./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:56:06,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:56:06,485 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:56:06,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:56:06,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:56:06,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:56:06,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:56:06,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:56:06,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:56:06,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:56:06,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:56:06,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:56:06,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:56:06,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:56:06,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:56:06,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:56:06,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:56:06,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:56:06,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:56:06,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:56:06,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:56:06,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:56:06,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:56:06,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:56:06,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:56:06,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:56:06,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:56:06,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:56:06,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:56:06,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:56:06,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:56:06,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:56:06,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:56:06,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:56:06,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:56:06,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:56:06,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:56:06,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:56:06,556 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e [2024-11-28 03:56:06,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:56:06,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:56:06,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:56:06,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:56:06,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:56:06,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2024-11-28 03:56:09,961 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/1b53377f4/03ea33c4001a4e47a05a451392a8a55e/FLAG31956880a [2024-11-28 03:56:10,234 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:56:10,234 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2024-11-28 03:56:10,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/1b53377f4/03ea33c4001a4e47a05a451392a8a55e/FLAG31956880a [2024-11-28 03:56:10,256 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/1b53377f4/03ea33c4001a4e47a05a451392a8a55e [2024-11-28 03:56:10,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:56:10,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:56:10,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:56:10,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:56:10,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:56:10,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c9ee7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10, skipping insertion in model container [2024-11-28 03:56:10,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:56:10,462 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2024-11-28 03:56:10,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:56:10,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:56:10,598 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2024-11-28 03:56:10,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:56:10,665 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:56:10,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10 WrapperNode [2024-11-28 03:56:10,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:56:10,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:56:10,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:56:10,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:56:10,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,755 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-28 03:56:10,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:56:10,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:56:10,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:56:10,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:56:10,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:56:10,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:56:10,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:56:10,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:56:10,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:56:10,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (1/1) ... [2024-11-28 03:56:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:56:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:56:10,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:56:10,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:56:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:56:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:56:10,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:56:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:56:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:56:10,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:56:11,023 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:56:11,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:56:11,490 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-28 03:56:11,490 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:56:11,502 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:56:11,503 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:56:11,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:56:11 BoogieIcfgContainer [2024-11-28 03:56:11,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:56:11,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:56:11,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:56:11,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:56:11,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:56:10" (1/3) ... [2024-11-28 03:56:11,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38627611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:56:11, skipping insertion in model container [2024-11-28 03:56:11,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:56:10" (2/3) ... [2024-11-28 03:56:11,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38627611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:56:11, skipping insertion in model container [2024-11-28 03:56:11,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:56:11" (3/3) ... [2024-11-28 03:56:11,514 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-81.i [2024-11-28 03:56:11,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:56:11,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-81.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:56:11,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:56:11,609 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;@381b83db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:56:11,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:56:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 03:56:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-28 03:56:11,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:11,635 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:11,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -274866789, now seen corresponding path program 1 times [2024-11-28 03:56:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140987622] [2024-11-28 03:56:11,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2024-11-28 03:56:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140987622] [2024-11-28 03:56:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140987622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:56:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968376914] [2024-11-28 03:56:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:56:12,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:56:12,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:56:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:12,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:56:12,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:56:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2024-11-28 03:56:12,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:56:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968376914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:56:12,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 03:56:12,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546758489] [2024-11-28 03:56:12,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:56:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:12,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:56:12,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:56:12,500 INFO L87 Difference]: Start difference. First operand has 86 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:56:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:12,542 INFO L93 Difference]: Finished difference Result 165 states and 292 transitions. [2024-11-28 03:56:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:56:12,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2024-11-28 03:56:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:12,555 INFO L225 Difference]: With dead ends: 165 [2024-11-28 03:56:12,555 INFO L226 Difference]: Without dead ends: 82 [2024-11-28 03:56:12,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:56:12,563 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:12,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:56:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-28 03:56:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-28 03:56:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 03:56:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-28 03:56:12,605 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 196 [2024-11-28 03:56:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:12,605 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-28 03:56:12,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:56:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-28 03:56:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-28 03:56:12,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:12,610 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:12,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:56:12,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:56:12,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -119824997, now seen corresponding path program 1 times [2024-11-28 03:56:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166839927] [2024-11-28 03:56:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:56:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:32,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166839927] [2024-11-28 03:56:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166839927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:56:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206432085] [2024-11-28 03:56:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:56:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:32,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:56:32,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:56:32,813 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:34,902 INFO L93 Difference]: Finished difference Result 250 states and 373 transitions. [2024-11-28 03:56:34,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:56:34,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2024-11-28 03:56:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:34,907 INFO L225 Difference]: With dead ends: 250 [2024-11-28 03:56:34,907 INFO L226 Difference]: Without dead ends: 171 [2024-11-28 03:56:34,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:56:34,909 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 186 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:34,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 567 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:56:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-28 03:56:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 100. [2024-11-28 03:56:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 03:56:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 153 transitions. [2024-11-28 03:56:34,927 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 153 transitions. Word has length 196 [2024-11-28 03:56:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 153 transitions. [2024-11-28 03:56:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 153 transitions. [2024-11-28 03:56:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-28 03:56:34,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:34,940 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:56:34,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:34,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash -706631011, now seen corresponding path program 1 times [2024-11-28 03:56:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:34,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068594553] [2024-11-28 03:56:34,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:34,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:56:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068594553] [2024-11-28 03:56:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068594553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:46,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:46,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 03:56:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850981346] [2024-11-28 03:56:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:56:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:46,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:56:46,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:56:46,843 INFO L87 Difference]: Start difference. First operand 100 states and 153 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:47,715 INFO L93 Difference]: Finished difference Result 291 states and 434 transitions. [2024-11-28 03:56:47,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:56:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2024-11-28 03:56:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:47,718 INFO L225 Difference]: With dead ends: 291 [2024-11-28 03:56:47,718 INFO L226 Difference]: Without dead ends: 194 [2024-11-28 03:56:47,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:56:47,720 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 204 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:47,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 453 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:56:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-28 03:56:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 137. [2024-11-28 03:56:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 97 states have internal predecessors, (134), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-28 03:56:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-28 03:56:47,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 196 [2024-11-28 03:56:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:47,762 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-28 03:56:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-28 03:56:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-28 03:56:47,770 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:47,770 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:47,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:56:47,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1399688675, now seen corresponding path program 1 times [2024-11-28 03:56:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238424406] [2024-11-28 03:56:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:56:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238424406] [2024-11-28 03:56:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238424406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:48,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:56:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893395337] [2024-11-28 03:56:48,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:48,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:56:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:48,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:56:48,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:56:48,063 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:48,291 INFO L93 Difference]: Finished difference Result 365 states and 561 transitions. [2024-11-28 03:56:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:56:48,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 196 [2024-11-28 03:56:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:48,299 INFO L225 Difference]: With dead ends: 365 [2024-11-28 03:56:48,300 INFO L226 Difference]: Without dead ends: 231 [2024-11-28 03:56:48,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:56:48,302 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 66 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:48,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 314 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:56:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-28 03:56:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-11-28 03:56:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.3513513513513513) internal successors, (200), 150 states have internal predecessors, (200), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-28 03:56:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 352 transitions. [2024-11-28 03:56:48,391 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 352 transitions. Word has length 196 [2024-11-28 03:56:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:48,392 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 352 transitions. [2024-11-28 03:56:48,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 352 transitions. [2024-11-28 03:56:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-28 03:56:48,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:48,395 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:48,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:56:48,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash -222444111, now seen corresponding path program 1 times [2024-11-28 03:56:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:48,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819492620] [2024-11-28 03:56:48,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:56:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:56:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:56:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819492620] [2024-11-28 03:56:56,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819492620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:56:56,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:56:56,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:56:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425049753] [2024-11-28 03:56:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:56:56,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:56:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:56:56,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:56:56,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:56:56,492 INFO L87 Difference]: Start difference. First operand 229 states and 352 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:56:57,241 INFO L93 Difference]: Finished difference Result 574 states and 868 transitions. [2024-11-28 03:56:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:56:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2024-11-28 03:56:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:56:57,245 INFO L225 Difference]: With dead ends: 574 [2024-11-28 03:56:57,245 INFO L226 Difference]: Without dead ends: 362 [2024-11-28 03:56:57,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:56:57,247 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:56:57,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 402 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:56:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-28 03:56:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 279. [2024-11-28 03:56:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 200 states have internal predecessors, (272), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-28 03:56:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2024-11-28 03:56:57,307 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 197 [2024-11-28 03:56:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:56:57,307 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2024-11-28 03:56:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:56:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2024-11-28 03:56:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-28 03:56:57,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:56:57,310 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:56:57,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:56:57,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:56:57,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:56:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1233561361, now seen corresponding path program 1 times [2024-11-28 03:56:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:56:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842827197] [2024-11-28 03:56:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:56:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:56:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:06,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842827197] [2024-11-28 03:57:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842827197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:06,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:57:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771553316] [2024-11-28 03:57:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:06,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:57:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:57:06,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:57:06,044 INFO L87 Difference]: Start difference. First operand 279 states and 424 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:06,761 INFO L93 Difference]: Finished difference Result 585 states and 881 transitions. [2024-11-28 03:57:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:57:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2024-11-28 03:57:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:06,765 INFO L225 Difference]: With dead ends: 585 [2024-11-28 03:57:06,765 INFO L226 Difference]: Without dead ends: 323 [2024-11-28 03:57:06,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:57:06,767 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:06,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 454 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:57:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-28 03:57:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 253. [2024-11-28 03:57:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 172 states have (on average 1.3546511627906976) internal successors, (233), 174 states have internal predecessors, (233), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-28 03:57:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 385 transitions. [2024-11-28 03:57:06,832 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 385 transitions. Word has length 197 [2024-11-28 03:57:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:06,834 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 385 transitions. [2024-11-28 03:57:06,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 385 transitions. [2024-11-28 03:57:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-28 03:57:06,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:06,837 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:06,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:57:06,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:06,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -36197359, now seen corresponding path program 1 times [2024-11-28 03:57:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795283382] [2024-11-28 03:57:06,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:06,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:06,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795283382] [2024-11-28 03:57:06,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795283382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:06,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:57:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914030170] [2024-11-28 03:57:06,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:06,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:57:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:06,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:57:06,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:57:06,931 INFO L87 Difference]: Start difference. First operand 253 states and 385 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:07,024 INFO L93 Difference]: Finished difference Result 610 states and 923 transitions. [2024-11-28 03:57:07,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:57:07,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2024-11-28 03:57:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:07,028 INFO L225 Difference]: With dead ends: 610 [2024-11-28 03:57:07,028 INFO L226 Difference]: Without dead ends: 374 [2024-11-28 03:57:07,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:57:07,033 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 60 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 254 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:57:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-28 03:57:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 370. [2024-11-28 03:57:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 265 states have internal predecessors, (347), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-28 03:57:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 551 transitions. [2024-11-28 03:57:07,117 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 551 transitions. Word has length 197 [2024-11-28 03:57:07,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 551 transitions. [2024-11-28 03:57:07,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 551 transitions. [2024-11-28 03:57:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-28 03:57:07,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:07,124 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:07,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:57:07,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:07,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 221968079, now seen corresponding path program 1 times [2024-11-28 03:57:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660517398] [2024-11-28 03:57:07,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660517398] [2024-11-28 03:57:14,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660517398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:14,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:14,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:57:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778584278] [2024-11-28 03:57:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:14,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:57:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:14,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:57:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:57:14,682 INFO L87 Difference]: Start difference. First operand 370 states and 551 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:15,459 INFO L93 Difference]: Finished difference Result 747 states and 1089 transitions. [2024-11-28 03:57:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:57:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2024-11-28 03:57:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:15,464 INFO L225 Difference]: With dead ends: 747 [2024-11-28 03:57:15,465 INFO L226 Difference]: Without dead ends: 526 [2024-11-28 03:57:15,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:57:15,466 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 146 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:15,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 397 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:57:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-28 03:57:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 379. [2024-11-28 03:57:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 269 states have (on average 1.3345724907063197) internal successors, (359), 274 states have internal predecessors, (359), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-28 03:57:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 563 transitions. [2024-11-28 03:57:15,547 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 563 transitions. Word has length 197 [2024-11-28 03:57:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:15,547 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 563 transitions. [2024-11-28 03:57:15,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 563 transitions. [2024-11-28 03:57:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-28 03:57:15,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:15,551 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:15,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:57:15,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:15,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash -364837935, now seen corresponding path program 1 times [2024-11-28 03:57:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:15,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150132519] [2024-11-28 03:57:15,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:22,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150132519] [2024-11-28 03:57:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150132519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:22,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:57:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424745974] [2024-11-28 03:57:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:57:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:57:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:57:22,760 INFO L87 Difference]: Start difference. First operand 379 states and 563 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:23,673 INFO L93 Difference]: Finished difference Result 653 states and 959 transitions. [2024-11-28 03:57:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:57:23,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 197 [2024-11-28 03:57:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:23,678 INFO L225 Difference]: With dead ends: 653 [2024-11-28 03:57:23,678 INFO L226 Difference]: Without dead ends: 423 [2024-11-28 03:57:23,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:57:23,681 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 134 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 477 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:57:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-28 03:57:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 375. [2024-11-28 03:57:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 265 states have (on average 1.3320754716981131) internal successors, (353), 270 states have internal predecessors, (353), 102 states have call successors, (102), 7 states have call predecessors, (102), 7 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-28 03:57:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 557 transitions. [2024-11-28 03:57:23,773 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 557 transitions. Word has length 197 [2024-11-28 03:57:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 557 transitions. [2024-11-28 03:57:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 557 transitions. [2024-11-28 03:57:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:57:23,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:23,776 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:57:23,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -21856618, now seen corresponding path program 1 times [2024-11-28 03:57:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286840605] [2024-11-28 03:57:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:49,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286840605] [2024-11-28 03:57:49,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286840605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:49,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:49,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:57:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229148472] [2024-11-28 03:57:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:49,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:57:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:49,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:57:49,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:57:49,595 INFO L87 Difference]: Start difference. First operand 375 states and 557 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:51,829 INFO L93 Difference]: Finished difference Result 540 states and 785 transitions. [2024-11-28 03:57:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:57:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:57:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:51,835 INFO L225 Difference]: With dead ends: 540 [2024-11-28 03:57:51,835 INFO L226 Difference]: Without dead ends: 538 [2024-11-28 03:57:51,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:57:51,837 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 117 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:51,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1140 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:57:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-28 03:57:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 535. [2024-11-28 03:57:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 372 states have (on average 1.2849462365591398) internal successors, (478), 381 states have internal predecessors, (478), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 141 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-28 03:57:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2024-11-28 03:57:51,962 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 198 [2024-11-28 03:57:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:51,963 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2024-11-28 03:57:51,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:57:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2024-11-28 03:57:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:57:51,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:51,966 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:57:51,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:51,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1702414017, now seen corresponding path program 1 times [2024-11-28 03:57:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440958563] [2024-11-28 03:57:51,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:57:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:57:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:57:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440958563] [2024-11-28 03:57:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440958563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:57:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:57:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:57:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750760660] [2024-11-28 03:57:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:57:56,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:57:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:57:56,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:57:56,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:57:56,634 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:57:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:57:58,183 INFO L93 Difference]: Finished difference Result 1361 states and 1953 transitions. [2024-11-28 03:57:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:57:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-11-28 03:57:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:57:58,191 INFO L225 Difference]: With dead ends: 1361 [2024-11-28 03:57:58,191 INFO L226 Difference]: Without dead ends: 975 [2024-11-28 03:57:58,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:57:58,194 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 392 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:57:58,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 579 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:57:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-28 03:57:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 858. [2024-11-28 03:57:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 584 states have (on average 1.2808219178082192) internal successors, (748), 596 states have internal predecessors, (748), 252 states have call successors, (252), 21 states have call predecessors, (252), 21 states have return successors, (252), 240 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-28 03:57:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1252 transitions. [2024-11-28 03:57:58,390 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1252 transitions. Word has length 198 [2024-11-28 03:57:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:57:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1252 transitions. [2024-11-28 03:57:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:57:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1252 transitions. [2024-11-28 03:57:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:57:58,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:57:58,393 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:57:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:57:58,394 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:57:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:57:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1001349439, now seen corresponding path program 1 times [2024-11-28 03:57:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:57:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465160441] [2024-11-28 03:57:58,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:57:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:57:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465160441] [2024-11-28 03:58:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465160441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:58:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819608559] [2024-11-28 03:58:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:58:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:02,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:58:02,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:58:02,389 INFO L87 Difference]: Start difference. First operand 858 states and 1252 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:02,969 INFO L93 Difference]: Finished difference Result 1640 states and 2355 transitions. [2024-11-28 03:58:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:58:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:02,976 INFO L225 Difference]: With dead ends: 1640 [2024-11-28 03:58:02,976 INFO L226 Difference]: Without dead ends: 1015 [2024-11-28 03:58:02,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:58:02,979 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 132 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 422 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:58:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-28 03:58:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 870. [2024-11-28 03:58:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 596 states have (on average 1.2835570469798658) internal successors, (765), 608 states have internal predecessors, (765), 252 states have call successors, (252), 21 states have call predecessors, (252), 21 states have return successors, (252), 240 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-28 03:58:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1269 transitions. [2024-11-28 03:58:03,198 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1269 transitions. Word has length 198 [2024-11-28 03:58:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:03,199 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1269 transitions. [2024-11-28 03:58:03,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1269 transitions. [2024-11-28 03:58:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:03,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:03,203 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:03,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:58:03,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1581436029, now seen corresponding path program 1 times [2024-11-28 03:58:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807022083] [2024-11-28 03:58:03,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807022083] [2024-11-28 03:58:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807022083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:07,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:07,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10384764] [2024-11-28 03:58:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:07,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:07,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:07,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:07,671 INFO L87 Difference]: Start difference. First operand 870 states and 1269 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:58:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:09,368 INFO L93 Difference]: Finished difference Result 1706 states and 2441 transitions. [2024-11-28 03:58:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:58:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-11-28 03:58:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:09,373 INFO L225 Difference]: With dead ends: 1706 [2024-11-28 03:58:09,373 INFO L226 Difference]: Without dead ends: 1069 [2024-11-28 03:58:09,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-11-28 03:58:09,375 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 453 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:09,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 629 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:58:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-28 03:58:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 874. [2024-11-28 03:58:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 600 states have (on average 1.285) internal successors, (771), 612 states have internal predecessors, (771), 252 states have call successors, (252), 21 states have call predecessors, (252), 21 states have return successors, (252), 240 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-28 03:58:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1275 transitions. [2024-11-28 03:58:09,572 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1275 transitions. Word has length 198 [2024-11-28 03:58:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1275 transitions. [2024-11-28 03:58:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 03:58:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1275 transitions. [2024-11-28 03:58:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:09,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:09,575 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:09,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:58:09,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:09,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2012466689, now seen corresponding path program 1 times [2024-11-28 03:58:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668667163] [2024-11-28 03:58:09,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668667163] [2024-11-28 03:58:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668667163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:58:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650371966] [2024-11-28 03:58:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:13,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:58:13,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:13,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:58:13,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:58:13,051 INFO L87 Difference]: Start difference. First operand 874 states and 1275 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:13,623 INFO L93 Difference]: Finished difference Result 1923 states and 2783 transitions. [2024-11-28 03:58:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:58:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:13,631 INFO L225 Difference]: With dead ends: 1923 [2024-11-28 03:58:13,631 INFO L226 Difference]: Without dead ends: 1066 [2024-11-28 03:58:13,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:58:13,634 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 97 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:13,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 387 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:58:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-11-28 03:58:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 902. [2024-11-28 03:58:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 628 states have (on average 1.2882165605095541) internal successors, (809), 640 states have internal predecessors, (809), 252 states have call successors, (252), 21 states have call predecessors, (252), 21 states have return successors, (252), 240 states have call predecessors, (252), 252 states have call successors, (252) [2024-11-28 03:58:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1313 transitions. [2024-11-28 03:58:13,810 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1313 transitions. Word has length 198 [2024-11-28 03:58:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1313 transitions. [2024-11-28 03:58:13,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1313 transitions. [2024-11-28 03:58:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:13,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:13,813 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:13,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:58:13,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 164255675, now seen corresponding path program 1 times [2024-11-28 03:58:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26428059] [2024-11-28 03:58:13,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:13,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26428059] [2024-11-28 03:58:13,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26428059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:13,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:13,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:58:13,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759014364] [2024-11-28 03:58:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:13,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:13,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:13,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:13,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:13,879 INFO L87 Difference]: Start difference. First operand 902 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:14,115 INFO L93 Difference]: Finished difference Result 1465 states and 2121 transitions. [2024-11-28 03:58:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:14,122 INFO L225 Difference]: With dead ends: 1465 [2024-11-28 03:58:14,123 INFO L226 Difference]: Without dead ends: 919 [2024-11-28 03:58:14,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:14,127 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:14,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 265 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:58:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-28 03:58:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 412. [2024-11-28 03:58:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 293 states have (on average 1.3242320819112627) internal successors, (388), 297 states have internal predecessors, (388), 108 states have call successors, (108), 10 states have call predecessors, (108), 10 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-28 03:58:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2024-11-28 03:58:14,234 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 198 [2024-11-28 03:58:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:14,234 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2024-11-28 03:58:14,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2024-11-28 03:58:14,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:14,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:14,236 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:14,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:58:14,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:14,237 INFO L85 PathProgramCache]: Analyzing trace with hash -645090951, now seen corresponding path program 1 times [2024-11-28 03:58:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966406736] [2024-11-28 03:58:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:21,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:21,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966406736] [2024-11-28 03:58:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966406736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:21,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:21,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041625752] [2024-11-28 03:58:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:21,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:21,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:21,130 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:24,001 INFO L93 Difference]: Finished difference Result 1161 states and 1635 transitions. [2024-11-28 03:58:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:58:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:24,006 INFO L225 Difference]: With dead ends: 1161 [2024-11-28 03:58:24,007 INFO L226 Difference]: Without dead ends: 766 [2024-11-28 03:58:24,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:58:24,009 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 289 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:24,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 482 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 03:58:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-28 03:58:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 415. [2024-11-28 03:58:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 296 states have (on average 1.3310810810810811) internal successors, (394), 300 states have internal predecessors, (394), 108 states have call successors, (108), 10 states have call predecessors, (108), 10 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-28 03:58:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 610 transitions. [2024-11-28 03:58:24,113 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 610 transitions. Word has length 198 [2024-11-28 03:58:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 610 transitions. [2024-11-28 03:58:24,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 610 transitions. [2024-11-28 03:58:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:24,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:24,115 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:58:24,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash -422550339, now seen corresponding path program 1 times [2024-11-28 03:58:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919184044] [2024-11-28 03:58:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919184044] [2024-11-28 03:58:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919184044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:58:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518559463] [2024-11-28 03:58:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:58:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:24,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:58:24,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:58:24,346 INFO L87 Difference]: Start difference. First operand 415 states and 610 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:24,580 INFO L93 Difference]: Finished difference Result 774 states and 1116 transitions. [2024-11-28 03:58:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:58:24,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:24,583 INFO L225 Difference]: With dead ends: 774 [2024-11-28 03:58:24,583 INFO L226 Difference]: Without dead ends: 490 [2024-11-28 03:58:24,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:58:24,584 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 132 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:24,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 365 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:58:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-28 03:58:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2024-11-28 03:58:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 337 states have (on average 1.2878338278931751) internal successors, (434), 343 states have internal predecessors, (434), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 690 transitions. [2024-11-28 03:58:24,702 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 690 transitions. Word has length 198 [2024-11-28 03:58:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:24,703 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 690 transitions. [2024-11-28 03:58:24,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 690 transitions. [2024-11-28 03:58:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:24,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:24,705 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:58:24,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1656208201, now seen corresponding path program 1 times [2024-11-28 03:58:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990663113] [2024-11-28 03:58:24,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:31,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990663113] [2024-11-28 03:58:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990663113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718473666] [2024-11-28 03:58:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:31,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:31,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:31,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:31,187 INFO L87 Difference]: Start difference. First operand 480 states and 690 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:34,277 INFO L93 Difference]: Finished difference Result 1097 states and 1551 transitions. [2024-11-28 03:58:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 03:58:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:34,281 INFO L225 Difference]: With dead ends: 1097 [2024-11-28 03:58:34,282 INFO L226 Difference]: Without dead ends: 634 [2024-11-28 03:58:34,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:58:34,284 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 167 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:34,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 530 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 03:58:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-28 03:58:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 449. [2024-11-28 03:58:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 306 states have (on average 1.2581699346405228) internal successors, (385), 312 states have internal predecessors, (385), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 641 transitions. [2024-11-28 03:58:34,424 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 641 transitions. Word has length 198 [2024-11-28 03:58:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:34,425 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 641 transitions. [2024-11-28 03:58:34,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 641 transitions. [2024-11-28 03:58:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:34,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:34,427 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:58:34,427 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2010898241, now seen corresponding path program 1 times [2024-11-28 03:58:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213734947] [2024-11-28 03:58:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:36,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213734947] [2024-11-28 03:58:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213734947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:36,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:36,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995221530] [2024-11-28 03:58:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:36,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:36,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:36,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:36,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:36,816 INFO L87 Difference]: Start difference. First operand 449 states and 641 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:38,697 INFO L93 Difference]: Finished difference Result 1060 states and 1481 transitions. [2024-11-28 03:58:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:58:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:38,702 INFO L225 Difference]: With dead ends: 1060 [2024-11-28 03:58:38,703 INFO L226 Difference]: Without dead ends: 628 [2024-11-28 03:58:38,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:58:38,705 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 313 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:38,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 528 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 03:58:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-28 03:58:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 450. [2024-11-28 03:58:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 307 states have (on average 1.260586319218241) internal successors, (387), 313 states have internal predecessors, (387), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 643 transitions. [2024-11-28 03:58:38,889 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 643 transitions. Word has length 198 [2024-11-28 03:58:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:38,890 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 643 transitions. [2024-11-28 03:58:38,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 643 transitions. [2024-11-28 03:58:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-28 03:58:38,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:38,892 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:38,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:58:38,892 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:38,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1272951805, now seen corresponding path program 1 times [2024-11-28 03:58:38,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:38,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206169108] [2024-11-28 03:58:38,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:38,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206169108] [2024-11-28 03:58:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206169108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:41,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:41,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501284506] [2024-11-28 03:58:41,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:41,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:41,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:41,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:41,177 INFO L87 Difference]: Start difference. First operand 450 states and 643 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:42,506 INFO L93 Difference]: Finished difference Result 957 states and 1351 transitions. [2024-11-28 03:58:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:58:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 198 [2024-11-28 03:58:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:42,510 INFO L225 Difference]: With dead ends: 957 [2024-11-28 03:58:42,510 INFO L226 Difference]: Without dead ends: 524 [2024-11-28 03:58:42,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:58:42,511 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 197 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:42,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 433 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:58:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-28 03:58:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 438. [2024-11-28 03:58:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 301 states have internal predecessors, (369), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 625 transitions. [2024-11-28 03:58:42,652 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 625 transitions. Word has length 198 [2024-11-28 03:58:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:42,652 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 625 transitions. [2024-11-28 03:58:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 625 transitions. [2024-11-28 03:58:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-28 03:58:42,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:42,654 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:42,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:58:42,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:42,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash 950549991, now seen corresponding path program 1 times [2024-11-28 03:58:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112946204] [2024-11-28 03:58:42,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:42,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112946204] [2024-11-28 03:58:42,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112946204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:42,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:42,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:58:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695365782] [2024-11-28 03:58:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:42,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:42,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:42,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:42,744 INFO L87 Difference]: Start difference. First operand 438 states and 625 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:42,932 INFO L93 Difference]: Finished difference Result 900 states and 1272 transitions. [2024-11-28 03:58:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-11-28 03:58:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:42,939 INFO L225 Difference]: With dead ends: 900 [2024-11-28 03:58:42,939 INFO L226 Difference]: Without dead ends: 479 [2024-11-28 03:58:42,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:42,942 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:42,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:58:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-28 03:58:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 449. [2024-11-28 03:58:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 312 states have internal predecessors, (373), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 629 transitions. [2024-11-28 03:58:43,080 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 629 transitions. Word has length 199 [2024-11-28 03:58:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 629 transitions. [2024-11-28 03:58:43,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 629 transitions. [2024-11-28 03:58:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-28 03:58:43,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:43,082 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:58:43,082 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash 145422636, now seen corresponding path program 1 times [2024-11-28 03:58:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590570661] [2024-11-28 03:58:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590570661] [2024-11-28 03:58:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590570661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:58:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704726441] [2024-11-28 03:58:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:58:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:58:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:58:44,498 INFO L87 Difference]: Start difference. First operand 449 states and 629 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:44,973 INFO L93 Difference]: Finished difference Result 638 states and 879 transitions. [2024-11-28 03:58:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:58:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-11-28 03:58:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:44,978 INFO L225 Difference]: With dead ends: 638 [2024-11-28 03:58:44,978 INFO L226 Difference]: Without dead ends: 636 [2024-11-28 03:58:44,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:58:44,980 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 89 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:44,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1291 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:58:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-28 03:58:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 469. [2024-11-28 03:58:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 326 states have (on average 1.205521472392638) internal successors, (393), 332 states have internal predecessors, (393), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 649 transitions. [2024-11-28 03:58:45,123 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 649 transitions. Word has length 199 [2024-11-28 03:58:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:45,123 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 649 transitions. [2024-11-28 03:58:45,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 649 transitions. [2024-11-28 03:58:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-28 03:58:45,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:45,125 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:45,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:58:45,125 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 771875656, now seen corresponding path program 1 times [2024-11-28 03:58:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807270954] [2024-11-28 03:58:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:58:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:45,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807270954] [2024-11-28 03:58:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807270954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:45,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:58:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445193638] [2024-11-28 03:58:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:45,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:45,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:45,202 INFO L87 Difference]: Start difference. First operand 469 states and 649 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:58:45,384 INFO L93 Difference]: Finished difference Result 947 states and 1304 transitions. [2024-11-28 03:58:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-11-28 03:58:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:58:45,389 INFO L225 Difference]: With dead ends: 947 [2024-11-28 03:58:45,389 INFO L226 Difference]: Without dead ends: 495 [2024-11-28 03:58:45,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:45,391 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 20 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:58:45,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:58:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-28 03:58:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 469. [2024-11-28 03:58:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 326 states have (on average 1.1932515337423313) internal successors, (389), 332 states have internal predecessors, (389), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:58:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 645 transitions. [2024-11-28 03:58:45,528 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 645 transitions. Word has length 199 [2024-11-28 03:58:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:58:45,528 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 645 transitions. [2024-11-28 03:58:45,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:58:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 645 transitions. [2024-11-28 03:58:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-28 03:58:45,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:58:45,530 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:58:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:58:45,530 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:58:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -213553291, now seen corresponding path program 1 times [2024-11-28 03:58:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454977962] [2024-11-28 03:58:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 03:59:10,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454977962] [2024-11-28 03:59:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454977962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:10,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:59:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137199876] [2024-11-28 03:59:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:10,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:59:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:10,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:59:10,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:59:10,209 INFO L87 Difference]: Start difference. First operand 469 states and 645 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:59:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:11,724 INFO L93 Difference]: Finished difference Result 668 states and 906 transitions. [2024-11-28 03:59:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:59:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-11-28 03:59:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:11,729 INFO L225 Difference]: With dead ends: 668 [2024-11-28 03:59:11,729 INFO L226 Difference]: Without dead ends: 666 [2024-11-28 03:59:11,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:59:11,731 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 122 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 719 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:59:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-28 03:59:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 487. [2024-11-28 03:59:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 344 states have (on average 1.191860465116279) internal successors, (410), 350 states have internal predecessors, (410), 128 states have call successors, (128), 14 states have call predecessors, (128), 14 states have return successors, (128), 122 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-28 03:59:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 666 transitions. [2024-11-28 03:59:11,927 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 666 transitions. Word has length 200 [2024-11-28 03:59:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:11,927 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 666 transitions. [2024-11-28 03:59:11,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 03:59:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 666 transitions. [2024-11-28 03:59:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-28 03:59:11,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:11,930 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:11,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:59:11,930 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:11,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash -471482054, now seen corresponding path program 1 times [2024-11-28 03:59:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308622712] [2024-11-28 03:59:11,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:00:41,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308622712] [2024-11-28 04:00:41,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308622712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:41,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:41,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:00:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692209334] [2024-11-28 04:00:41,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:00:41,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:41,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:00:41,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:00:41,466 INFO L87 Difference]: Start difference. First operand 487 states and 666 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:00:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:43,656 INFO L93 Difference]: Finished difference Result 672 states and 909 transitions. [2024-11-28 04:00:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:00:43,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-11-28 04:00:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:43,662 INFO L225 Difference]: With dead ends: 672 [2024-11-28 04:00:43,662 INFO L226 Difference]: Without dead ends: 670 [2024-11-28 04:00:43,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:00:43,663 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 127 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:43,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1259 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 04:00:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-28 04:00:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 493. [2024-11-28 04:00:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 345 states have (on average 1.191304347826087) internal successors, (411), 351 states have internal predecessors, (411), 132 states have call successors, (132), 15 states have call predecessors, (132), 15 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-28 04:00:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 675 transitions. [2024-11-28 04:00:43,856 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 675 transitions. Word has length 200 [2024-11-28 04:00:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:43,857 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 675 transitions. [2024-11-28 04:00:43,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:00:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 675 transitions. [2024-11-28 04:00:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-28 04:00:43,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:43,859 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:43,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 04:00:43,859 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:43,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash 113776195, now seen corresponding path program 1 times [2024-11-28 04:00:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:43,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977666236] [2024-11-28 04:00:43,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:00:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977666236] [2024-11-28 04:00:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977666236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:00:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:00:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:00:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347545618] [2024-11-28 04:00:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:00:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:00:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:49,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:00:49,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:00:49,407 INFO L87 Difference]: Start difference. First operand 493 states and 675 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:00:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:50,241 INFO L93 Difference]: Finished difference Result 728 states and 977 transitions. [2024-11-28 04:00:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:00:50,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-11-28 04:00:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:50,247 INFO L225 Difference]: With dead ends: 728 [2024-11-28 04:00:50,247 INFO L226 Difference]: Without dead ends: 726 [2024-11-28 04:00:50,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:00:50,248 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 118 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:50,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1169 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:00:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-28 04:00:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 514. [2024-11-28 04:00:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 366 states have (on average 1.1967213114754098) internal successors, (438), 372 states have internal predecessors, (438), 132 states have call successors, (132), 15 states have call predecessors, (132), 15 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-28 04:00:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 702 transitions. [2024-11-28 04:00:50,458 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 702 transitions. Word has length 201 [2024-11-28 04:00:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 702 transitions. [2024-11-28 04:00:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:00:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 702 transitions. [2024-11-28 04:00:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-28 04:00:50,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:50,461 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:50,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 04:00:50,462 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:50,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1456664919, now seen corresponding path program 1 times [2024-11-28 04:00:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:50,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819699545] [2024-11-28 04:00:50,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:01:21,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819699545] [2024-11-28 04:01:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819699545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:21,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:21,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:01:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679352431] [2024-11-28 04:01:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:21,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:01:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:21,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:01:21,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:01:21,271 INFO L87 Difference]: Start difference. First operand 514 states and 702 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:23,357 INFO L93 Difference]: Finished difference Result 727 states and 969 transitions. [2024-11-28 04:01:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:01:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-11-28 04:01:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:23,362 INFO L225 Difference]: With dead ends: 727 [2024-11-28 04:01:23,362 INFO L226 Difference]: Without dead ends: 725 [2024-11-28 04:01:23,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:01:23,363 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:23,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 968 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:01:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-11-28 04:01:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 701. [2024-11-28 04:01:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 496 states have (on average 1.1733870967741935) internal successors, (582), 506 states have internal predecessors, (582), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 170 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-28 04:01:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 942 transitions. [2024-11-28 04:01:23,568 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 942 transitions. Word has length 201 [2024-11-28 04:01:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:23,569 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 942 transitions. [2024-11-28 04:01:23,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 942 transitions. [2024-11-28 04:01:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-28 04:01:23,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:23,571 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:23,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 04:01:23,571 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash 946087351, now seen corresponding path program 1 times [2024-11-28 04:01:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:23,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054084464] [2024-11-28 04:01:23,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:01:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054084464] [2024-11-28 04:01:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054084464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774950889] [2024-11-28 04:01:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:23,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:01:23,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:23,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:01:23,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:23,646 INFO L87 Difference]: Start difference. First operand 701 states and 942 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:24,006 INFO L93 Difference]: Finished difference Result 1424 states and 1903 transitions. [2024-11-28 04:01:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:01:24,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-11-28 04:01:24,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:24,011 INFO L225 Difference]: With dead ends: 1424 [2024-11-28 04:01:24,011 INFO L226 Difference]: Without dead ends: 750 [2024-11-28 04:01:24,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:24,014 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:24,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:01:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-28 04:01:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 698. [2024-11-28 04:01:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 493 states have (on average 1.154158215010142) internal successors, (569), 503 states have internal predecessors, (569), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 170 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-28 04:01:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 929 transitions. [2024-11-28 04:01:24,265 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 929 transitions. Word has length 202 [2024-11-28 04:01:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 929 transitions. [2024-11-28 04:01:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 929 transitions. [2024-11-28 04:01:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-28 04:01:24,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:24,268 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:24,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 04:01:24,268 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:24,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1516777428, now seen corresponding path program 1 times [2024-11-28 04:01:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530708080] [2024-11-28 04:01:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:01:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530708080] [2024-11-28 04:01:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530708080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:01:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198782981] [2024-11-28 04:01:24,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:24,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:01:24,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:24,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:01:24,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:24,341 INFO L87 Difference]: Start difference. First operand 698 states and 929 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:24,656 INFO L93 Difference]: Finished difference Result 1407 states and 1863 transitions. [2024-11-28 04:01:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:01:24,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-11-28 04:01:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:24,662 INFO L225 Difference]: With dead ends: 1407 [2024-11-28 04:01:24,662 INFO L226 Difference]: Without dead ends: 736 [2024-11-28 04:01:24,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:01:24,665 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:24,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 236 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:01:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-28 04:01:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 698. [2024-11-28 04:01:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 493 states have (on average 1.1399594320486814) internal successors, (562), 503 states have internal predecessors, (562), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 170 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-28 04:01:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 922 transitions. [2024-11-28 04:01:24,935 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 922 transitions. Word has length 202 [2024-11-28 04:01:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:24,936 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 922 transitions. [2024-11-28 04:01:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 922 transitions. [2024-11-28 04:01:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-28 04:01:24,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:24,938 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:24,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 04:01:24,938 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:24,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -469043187, now seen corresponding path program 1 times [2024-11-28 04:01:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072069957] [2024-11-28 04:01:24,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-28 04:01:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:01:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072069957] [2024-11-28 04:01:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072069957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:30,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:01:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934633002] [2024-11-28 04:01:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:01:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:01:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:01:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:01:30,487 INFO L87 Difference]: Start difference. First operand 698 states and 922 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:31,384 INFO L93 Difference]: Finished difference Result 951 states and 1246 transitions. [2024-11-28 04:01:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:01:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-11-28 04:01:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:31,390 INFO L225 Difference]: With dead ends: 951 [2024-11-28 04:01:31,390 INFO L226 Difference]: Without dead ends: 949 [2024-11-28 04:01:31,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:01:31,392 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 157 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:31,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 921 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:01:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-28 04:01:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 688. [2024-11-28 04:01:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 483 states have (on average 1.1428571428571428) internal successors, (552), 493 states have internal predecessors, (552), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 170 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-28 04:01:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 912 transitions. [2024-11-28 04:01:31,669 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 912 transitions. Word has length 202 [2024-11-28 04:01:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:31,669 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 912 transitions. [2024-11-28 04:01:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-28 04:01:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 912 transitions. [2024-11-28 04:01:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-28 04:01:31,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:31,671 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 04:01:31,672 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1489452614, now seen corresponding path program 1 times [2024-11-28 04:01:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:01:31,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049963984] [2024-11-28 04:01:31,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:01:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:01:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50661187] [2024-11-28 04:01:31,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:31,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:31,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:31,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:01:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:01:31,921 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 04:01:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 04:01:32,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 04:01:32,124 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 04:01:32,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 04:01:32,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:01:32,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:32,331 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:32,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:01:32,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:01:32 BoogieIcfgContainer [2024-11-28 04:01:32,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:01:32,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:01:32,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:01:32,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:01:32,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:56:11" (3/4) ... [2024-11-28 04:01:32,503 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 04:01:32,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:01:32,505 INFO L158 Benchmark]: Toolchain (without parser) took 322244.74ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 117.4MB in the beginning and 906.6MB in the end (delta: -789.2MB). Peak memory consumption was 703.4MB. Max. memory is 16.1GB. [2024-11-28 04:01:32,505 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:01:32,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.94ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 102.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:01:32,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.58ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 98.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:01:32,506 INFO L158 Benchmark]: Boogie Preprocessor took 102.32ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 93.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:01:32,506 INFO L158 Benchmark]: RCFGBuilder took 644.45ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 68.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 04:01:32,506 INFO L158 Benchmark]: TraceAbstraction took 320992.89ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 67.7MB in the beginning and 906.9MB in the end (delta: -839.2MB). Peak memory consumption was 653.1MB. Max. memory is 16.1GB. [2024-11-28 04:01:32,506 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 1.6GB. Free memory was 906.9MB in the beginning and 906.6MB in the end (delta: 289.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:01:32,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.94ms. Allocated memory is still 142.6MB. Free memory was 117.1MB in the beginning and 102.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.58ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 98.8MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 102.32ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 93.5MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 644.45ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 68.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 320992.89ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 67.7MB in the beginning and 906.9MB in the end (delta: -839.2MB). Peak memory consumption was 653.1MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 1.6GB. Free memory was 906.9MB in the beginning and 906.6MB in the end (delta: 289.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 73, overapproximation of bitwiseAnd at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed long int var_1_2 = -2; [L24] signed long int var_1_3 = -32; [L25] signed long int var_1_4 = 50; [L26] unsigned char var_1_5 = 128; [L27] unsigned char var_1_6 = 4; [L28] unsigned char var_1_7 = 10; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 1; [L31] unsigned long int var_1_10 = 0; [L32] unsigned short int var_1_11 = 4; [L33] unsigned short int var_1_12 = 54828; [L34] unsigned short int var_1_13 = 61894; [L35] unsigned short int var_1_14 = 10000; [L36] unsigned short int var_1_15 = 10000; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 32; [L39] signed char var_1_18 = 64; [L40] signed char var_1_19 = 10; [L41] signed char var_1_20 = 8; [L42] signed char var_1_21 = 5; [L43] signed char var_1_22 = 2; [L44] signed char var_1_23 = 64; [L45] signed long int var_1_24 = -5; VAL [isInitial=0, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-2, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L139] isInitial = 1 [L140] FCALL initially() [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L86] var_1_3 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=50, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L89] var_1_4 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=128, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L92] var_1_5 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=4, var_1_7=10, var_1_8=0, var_1_9=1] [L95] var_1_6 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_7=10, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_7=10, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=0, var_1_9=1] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=1] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=54828, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L104] var_1_12 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_12 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_12 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L106] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=61894, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L107] var_1_13 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=10000, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L110] var_1_14 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_14 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_14 >= 8191) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_14 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 <= 16384) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=10000, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L113] var_1_15 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_15 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_15 >= 8192) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=64, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L116] var_1_18 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=10, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L119] var_1_19 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L121] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=8, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L122] var_1_20 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L124] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=5, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L125] var_1_21 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L127] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=2, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L128] var_1_22 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=5, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L143] RET updateVariables() [L144] CALL step() [L49] COND TRUE var_1_2 != (var_1_3 + var_1_4) [L50] var_1_1 = (var_1_5 - ((((0) < (var_1_6)) ? (0) : (var_1_6)))) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=10, var_1_8=1, var_1_9=0] [L52] COND TRUE ((var_1_6 / var_1_5) != ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) && var_1_8 [L53] var_1_7 = var_1_5 VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L61] COND TRUE ! var_1_9 [L62] var_1_10 = ((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) VAL [isInitial=1, var_1_10=254, var_1_11=4, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L64] COND TRUE \read(var_1_8) [L65] var_1_11 = (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - ((var_1_14 + var_1_15) - var_1_1)) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=0, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L67] var_1_16 = (var_1_7 - 1) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=32, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L68] COND TRUE var_1_11 > ((((var_1_2) > (var_1_5)) ? (var_1_2) : (var_1_5))) [L69] var_1_17 = (var_1_18 - var_1_19) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L73] EXPR var_1_13 & var_1_2 VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L73] COND FALSE !(! ((var_1_13 & var_1_2) != var_1_1)) [L76] COND FALSE !(! var_1_8) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=-5, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L80] var_1_24 = var_1_12 VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR (((((((var_1_2 != (var_1_3 + var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 - ((((0) < (var_1_6)) ? (0) : (var_1_6)))))) : 1) && ((((var_1_6 / var_1_5) != ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) && var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (((var_1_1 > var_1_5) || var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (var_1_7 == ((unsigned char) var_1_6))))) && ((! var_1_9) ? (var_1_10 == ((unsigned long int) ((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))))) : 1)) && (var_1_8 ? (var_1_11 == ((unsigned short int) (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - ((var_1_14 + var_1_15) - var_1_1)))) : 1)) && (var_1_16 == ((signed short int) (var_1_7 - 1)))) && ((var_1_11 > ((((var_1_2) > (var_1_5)) ? (var_1_2) : (var_1_5)))) ? (var_1_17 == ((signed char) (var_1_18 - var_1_19))) : (var_1_17 == ((signed char) (var_1_20 - (var_1_21 + var_1_22)))))) && ((! ((var_1_13 & var_1_2) != var_1_1)) ? (var_1_23 == ((signed char) ((((var_1_20) < ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22))))) ? (var_1_20) : ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22)))))))) : ((! var_1_8) ? (var_1_23 == ((signed char) (var_1_22 + var_1_21))) : 1)) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L135] EXPR var_1_13 & var_1_2 VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L135] EXPR (((((((var_1_2 != (var_1_3 + var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 - ((((0) < (var_1_6)) ? (0) : (var_1_6)))))) : 1) && ((((var_1_6 / var_1_5) != ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) && var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (((var_1_1 > var_1_5) || var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (var_1_7 == ((unsigned char) var_1_6))))) && ((! var_1_9) ? (var_1_10 == ((unsigned long int) ((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))))) : 1)) && (var_1_8 ? (var_1_11 == ((unsigned short int) (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - ((var_1_14 + var_1_15) - var_1_1)))) : 1)) && (var_1_16 == ((signed short int) (var_1_7 - 1)))) && ((var_1_11 > ((((var_1_2) > (var_1_5)) ? (var_1_2) : (var_1_5)))) ? (var_1_17 == ((signed char) (var_1_18 - var_1_19))) : (var_1_17 == ((signed char) (var_1_20 - (var_1_21 + var_1_22)))))) && ((! ((var_1_13 & var_1_2) != var_1_1)) ? (var_1_23 == ((signed char) ((((var_1_20) < ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22))))) ? (var_1_20) : ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22)))))))) : ((! var_1_8) ? (var_1_23 == ((signed char) (var_1_22 + var_1_21))) : 1)) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L135-L136] return ((((((((var_1_2 != (var_1_3 + var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_5 - ((((0) < (var_1_6)) ? (0) : (var_1_6)))))) : 1) && ((((var_1_6 / var_1_5) != ((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) && var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (((var_1_1 > var_1_5) || var_1_8) ? (var_1_7 == ((unsigned char) var_1_5)) : (var_1_7 == ((unsigned char) var_1_6))))) && ((! var_1_9) ? (var_1_10 == ((unsigned long int) ((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))))) : 1)) && (var_1_8 ? (var_1_11 == ((unsigned short int) (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - ((var_1_14 + var_1_15) - var_1_1)))) : 1)) && (var_1_16 == ((signed short int) (var_1_7 - 1)))) && ((var_1_11 > ((((var_1_2) > (var_1_5)) ? (var_1_2) : (var_1_5)))) ? (var_1_17 == ((signed char) (var_1_18 - var_1_19))) : (var_1_17 == ((signed char) (var_1_20 - (var_1_21 + var_1_22)))))) && ((! ((var_1_13 & var_1_2) != var_1_1)) ? (var_1_23 == ((signed char) ((((var_1_20) < ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22))))) ? (var_1_20) : ((((((var_1_21 + -4)) < (var_1_22)) ? ((var_1_21 + -4)) : (var_1_22)))))))) : ((! var_1_8) ? (var_1_23 == ((signed char) (var_1_22 + var_1_21))) : 1))) && (var_1_24 == ((signed long int) var_1_12)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=16638, var_1_12=32767, var_1_13=32768, var_1_14=-57344, var_1_15=73728, var_1_16=253, var_1_17=126, var_1_18=126, var_1_19=0, var_1_1=254, var_1_20=59, var_1_21=63, var_1_22=59, var_1_23=64, var_1_24=32767, var_1_2=-32516, var_1_3=-32516, var_1_4=1, var_1_5=-2, var_1_6=1, var_1_7=-2, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 320.8s, OverallIterations: 31, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4098 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4098 mSDsluCounter, 16463 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12267 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6714 IncrementalHoareTripleChecker+Invalid, 6981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 4196 mSDtfsCounter, 6714 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=14, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 3589 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 281.3s InterpolantComputationTime, 6554 NumberOfCodeBlocks, 6554 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 6117 ConstructedInterpolants, 0 QuantifiedInterpolants, 48190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 61442/61504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 04:01:32,720 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 04:01:32,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:01:35,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:01:35,536 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 04:01:35,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:01:35,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:01:35,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:01:35,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:01:35,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:01:35,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:01:35,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:01:35,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:01:35,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:01:35,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:01:35,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:01:35,605 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:01:35,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:01:35,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:01:35,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:01:35,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:01:35,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:01:35,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:01:35,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:01:35,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:01:35,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:01:35,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:01:35,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:01:35,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:01:35,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:01:35,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:01:35,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:35,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:01:35,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:01:35,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:01:35,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:01:35,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:35,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:01:35,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:01:35,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:01:35,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:01:35,611 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:01:35,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:01:35,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:01:35,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:01:35,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:01:35,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:01:35,613 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ec23d859d65533fc787a9c2fed70b8c69daa3b1ed2a3fca10d530d490a26e0e [2024-11-28 04:01:35,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:01:35,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:01:35,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:01:35,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:01:35,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:01:35,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2024-11-28 04:01:39,199 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/d7c1cce1e/41337d8495de4b0caf15bfeaaab5c195/FLAG02dd4a9ca [2024-11-28 04:01:39,542 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:01:39,545 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i [2024-11-28 04:01:39,557 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/d7c1cce1e/41337d8495de4b0caf15bfeaaab5c195/FLAG02dd4a9ca [2024-11-28 04:01:39,581 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/data/d7c1cce1e/41337d8495de4b0caf15bfeaaab5c195 [2024-11-28 04:01:39,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:01:39,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:01:39,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:01:39,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:01:39,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:01:39,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:01:39" (1/1) ... [2024-11-28 04:01:39,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f928c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:39, skipping insertion in model container [2024-11-28 04:01:39,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:01:39" (1/1) ... [2024-11-28 04:01:39,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:01:39,827 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2024-11-28 04:01:39,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:01:39,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:01:39,939 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_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-81.i[913,926] [2024-11-28 04:01:39,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:01:40,002 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:01:40,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40 WrapperNode [2024-11-28 04:01:40,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:01:40,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:01:40,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:01:40,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:01:40,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,056 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-28 04:01:40,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:01:40,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:01:40,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:01:40,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:01:40,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 04:01:40,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:01:40,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:01:40,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:01:40,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:01:40,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (1/1) ... [2024-11-28 04:01:40,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:01:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:40,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:01:40,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:01:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:01:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:01:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 04:01:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 04:01:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:01:40,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:01:40,299 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:01:40,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:01:40,748 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-28 04:01:40,749 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:01:40,799 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:01:40,803 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 04:01:40,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:01:40 BoogieIcfgContainer [2024-11-28 04:01:40,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:01:40,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:01:40,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:01:40,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:01:40,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:01:39" (1/3) ... [2024-11-28 04:01:40,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1a1464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:01:40, skipping insertion in model container [2024-11-28 04:01:40,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:01:40" (2/3) ... [2024-11-28 04:01:40,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1a1464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:01:40, skipping insertion in model container [2024-11-28 04:01:40,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:01:40" (3/3) ... [2024-11-28 04:01:40,819 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-81.i [2024-11-28 04:01:40,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:01:40,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-81.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 04:01:40,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:01:40,949 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;@af2e719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:01:40,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 04:01:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 04:01:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-28 04:01:40,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:40,973 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:40,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash 887177240, now seen corresponding path program 1 times [2024-11-28 04:01:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:01:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481067969] [2024-11-28 04:01:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:41,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:41,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:41,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:41,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:01:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:41,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:01:41,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:01:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2024-11-28 04:01:41,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:01:41,314 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:01:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481067969] [2024-11-28 04:01:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481067969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:01:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:01:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:01:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228823526] [2024-11-28 04:01:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:01:41,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:01:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:01:41,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:01:41,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:01:41,348 INFO L87 Difference]: Start difference. First operand has 77 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 04:01:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:01:41,399 INFO L93 Difference]: Finished difference Result 147 states and 264 transitions. [2024-11-28 04:01:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:01:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 193 [2024-11-28 04:01:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:01:41,411 INFO L225 Difference]: With dead ends: 147 [2024-11-28 04:01:41,412 INFO L226 Difference]: Without dead ends: 73 [2024-11-28 04:01:41,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:01:41,420 INFO L435 NwaCegarLoop]: 112 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, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:01:41,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:01:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-28 04:01:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-28 04:01:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-28 04:01:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-28 04:01:41,488 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 193 [2024-11-28 04:01:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:01:41,491 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-28 04:01:41,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-28 04:01:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-28 04:01:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-28 04:01:41,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:01:41,500 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:01:41,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:01:41,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:41,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:01:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:01:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 712736792, now seen corresponding path program 1 times [2024-11-28 04:01:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:01:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47963359] [2024-11-28 04:01:41,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:01:41,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:01:41,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:01:41,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:01:41,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0d7a9ca-41e6-44f9-b5e6-b83ea7eb4f52/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:01:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:01:41,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 04:01:41,989 INFO L279 TraceCheckSpWp]: Computing forward predicates...