./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme --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 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:00,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:00,841 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:04:00,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:00,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:00,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:00,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:00,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:00,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:04:00,880 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:04:00,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:00,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:00,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:00,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:00,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:00,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:00,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:04:00,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:00,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:04:00,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:00,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:00,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:04:00,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:00,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:04:00,892 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:00,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:04:00,893 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:00,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:00,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:00,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:04:00,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:00,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:00,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:00,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:00,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:04:00,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:04:00,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:04:00,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:00,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:00,900 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:04:00,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:00,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:00,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme 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 -> 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 [2023-11-26 12:04:01,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:04:01,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:04:01,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:04:01,247 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:04:01,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:04:01,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:04,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:04:05,033 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:04:05,033 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:05,047 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/49294a181/27f4c956c9a94b9d9141c89faed6e1b2/FLAG3e1c83079 [2023-11-26 12:04:05,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/49294a181/27f4c956c9a94b9d9141c89faed6e1b2 [2023-11-26 12:04:05,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:04:05,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:04:05,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:05,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:04:05,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:04:05,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d285130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05, skipping insertion in model container [2023-11-26 12:04:05,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,136 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:04:05,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i[917,930] [2023-11-26 12:04:05,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:05,484 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:04:05,499 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i[917,930] [2023-11-26 12:04:05,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:05,558 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:04:05,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05 WrapperNode [2023-11-26 12:04:05,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:05,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:05,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:04:05,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:04:05,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,661 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2023-11-26 12:04:05,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:05,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:04:05,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:04:05,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:04:05,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,705 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 12:04:05,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:04:05,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:04:05,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:04:05,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:04:05,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (1/1) ... [2023-11-26 12:04:05,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:04:05,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:04:05,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:04:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:04:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:04:05,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:04:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:04:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:04:05,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:04:05,972 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:04:05,975 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:04:06,592 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:04:06,676 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:04:06,680 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:04:06,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:06 BoogieIcfgContainer [2023-11-26 12:04:06,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:04:06,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:04:06,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:04:06,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:04:06,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:05" (1/3) ... [2023-11-26 12:04:06,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2530eaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:06, skipping insertion in model container [2023-11-26 12:04:06,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:05" (2/3) ... [2023-11-26 12:04:06,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2530eaeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:06, skipping insertion in model container [2023-11-26 12:04:06,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:06" (3/3) ... [2023-11-26 12:04:06,699 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:06,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:04:06,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:04:06,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:04:06,795 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@691ec85f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:04:06,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:04:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:04:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-26 12:04:06,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:06,826 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:06,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:06,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash 708690180, now seen corresponding path program 1 times [2023-11-26 12:04:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862054585] [2023-11-26 12:04:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:07,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:07,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862054585] [2023-11-26 12:04:07,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862054585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:07,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:07,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667103249] [2023-11-26 12:04:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:07,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:04:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:04:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:04:07,918 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:04:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:08,014 INFO L93 Difference]: Finished difference Result 189 states and 342 transitions. [2023-11-26 12:04:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:04:08,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 219 [2023-11-26 12:04:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:08,035 INFO L225 Difference]: With dead ends: 189 [2023-11-26 12:04:08,036 INFO L226 Difference]: Without dead ends: 94 [2023-11-26 12:04:08,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:04:08,046 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:08,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 12:04:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-26 12:04:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-26 12:04:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:04:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 149 transitions. [2023-11-26 12:04:08,120 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 149 transitions. Word has length 219 [2023-11-26 12:04:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:08,121 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 149 transitions. [2023-11-26 12:04:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:04:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 149 transitions. [2023-11-26 12:04:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-26 12:04:08,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:08,129 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:08,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:04:08,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:08,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1358781052, now seen corresponding path program 1 times [2023-11-26 12:04:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001989144] [2023-11-26 12:04:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001989144] [2023-11-26 12:04:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001989144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690272364] [2023-11-26 12:04:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:04:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:09,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:04:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:04:09,207 INFO L87 Difference]: Start difference. First operand 94 states and 149 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:09,849 INFO L93 Difference]: Finished difference Result 323 states and 510 transitions. [2023-11-26 12:04:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:04:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2023-11-26 12:04:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:09,863 INFO L225 Difference]: With dead ends: 323 [2023-11-26 12:04:09,864 INFO L226 Difference]: Without dead ends: 230 [2023-11-26 12:04:09,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:09,868 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 170 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:09,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 408 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 12:04:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-26 12:04:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2023-11-26 12:04:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 142 states have internal predecessors, (198), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-26 12:04:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2023-11-26 12:04:09,957 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 219 [2023-11-26 12:04:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:09,960 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2023-11-26 12:04:09,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2023-11-26 12:04:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-26 12:04:09,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:09,968 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:09,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:04:09,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:09,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2126839618, now seen corresponding path program 1 times [2023-11-26 12:04:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747362229] [2023-11-26 12:04:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747362229] [2023-11-26 12:04:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747362229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:12,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:12,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106467490] [2023-11-26 12:04:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:12,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:12,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:12,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:12,006 INFO L87 Difference]: Start difference. First operand 225 states and 358 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:12,976 INFO L93 Difference]: Finished difference Result 536 states and 856 transitions. [2023-11-26 12:04:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:04:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2023-11-26 12:04:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:12,984 INFO L225 Difference]: With dead ends: 536 [2023-11-26 12:04:12,985 INFO L226 Difference]: Without dead ends: 312 [2023-11-26 12:04:12,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:04:12,988 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 107 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:12,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 538 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:04:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-26 12:04:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 271. [2023-11-26 12:04:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 187 states have (on average 1.4705882352941178) internal successors, (275), 188 states have internal predecessors, (275), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-26 12:04:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 435 transitions. [2023-11-26 12:04:13,083 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 435 transitions. Word has length 219 [2023-11-26 12:04:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:13,088 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 435 transitions. [2023-11-26 12:04:13,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 435 transitions. [2023-11-26 12:04:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-26 12:04:13,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:13,095 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:13,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:04:13,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:13,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash 538491716, now seen corresponding path program 1 times [2023-11-26 12:04:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:13,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503606400] [2023-11-26 12:04:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503606400] [2023-11-26 12:04:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503606400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281856288] [2023-11-26 12:04:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:16,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:16,004 INFO L87 Difference]: Start difference. First operand 271 states and 435 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:17,225 INFO L93 Difference]: Finished difference Result 706 states and 1132 transitions. [2023-11-26 12:04:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:04:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2023-11-26 12:04:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:17,231 INFO L225 Difference]: With dead ends: 706 [2023-11-26 12:04:17,231 INFO L226 Difference]: Without dead ends: 436 [2023-11-26 12:04:17,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:04:17,235 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 465 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:04:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-11-26 12:04:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 277. [2023-11-26 12:04:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 193 states have (on average 1.4766839378238341) internal successors, (285), 194 states have internal predecessors, (285), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-26 12:04:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 445 transitions. [2023-11-26 12:04:17,279 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 445 transitions. Word has length 219 [2023-11-26 12:04:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:17,280 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 445 transitions. [2023-11-26 12:04:17,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 445 transitions. [2023-11-26 12:04:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-26 12:04:17,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:17,284 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:04:17,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1462258812, now seen corresponding path program 1 times [2023-11-26 12:04:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797812581] [2023-11-26 12:04:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797812581] [2023-11-26 12:04:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797812581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 12:04:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620853724] [2023-11-26 12:04:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 12:04:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 12:04:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-26 12:04:25,478 INFO L87 Difference]: Start difference. First operand 277 states and 445 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:27,368 INFO L93 Difference]: Finished difference Result 668 states and 1066 transitions. [2023-11-26 12:04:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 12:04:27,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2023-11-26 12:04:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:27,373 INFO L225 Difference]: With dead ends: 668 [2023-11-26 12:04:27,373 INFO L226 Difference]: Without dead ends: 392 [2023-11-26 12:04:27,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-26 12:04:27,381 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 217 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:27,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 616 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-26 12:04:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-26 12:04:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 288. [2023-11-26 12:04:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 204 states have (on average 1.4607843137254901) internal successors, (298), 205 states have internal predecessors, (298), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-26 12:04:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 458 transitions. [2023-11-26 12:04:27,430 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 458 transitions. Word has length 220 [2023-11-26 12:04:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:27,431 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 458 transitions. [2023-11-26 12:04:27,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 458 transitions. [2023-11-26 12:04:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-26 12:04:27,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:27,435 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:27,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:04:27,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:27,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1002293504, now seen corresponding path program 1 times [2023-11-26 12:04:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024749619] [2023-11-26 12:04:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 12:04:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 12:04:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 12:04:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 12:04:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 12:04:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 12:04:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 12:04:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 12:04:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 12:04:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 12:04:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 12:04:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 12:04:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 12:04:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 12:04:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 12:04:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 12:04:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 12:04:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 12:04:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-26 12:04:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 12:04:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-26 12:04:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-26 12:04:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-26 12:04:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-26 12:04:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 12:04:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-26 12:04:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-26 12:04:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-26 12:04:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-26 12:04:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 12:04:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 12:04:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 12:04:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-26 12:04:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 12:04:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-26 12:04:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-26 12:04:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 12:04:28,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024749619] [2023-11-26 12:04:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024749619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647164576] [2023-11-26 12:04:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:28,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:28,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:28,239 INFO L87 Difference]: Start difference. First operand 288 states and 458 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:28,806 INFO L93 Difference]: Finished difference Result 666 states and 1058 transitions. [2023-11-26 12:04:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:04:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 220 [2023-11-26 12:04:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:28,812 INFO L225 Difference]: With dead ends: 666 [2023-11-26 12:04:28,812 INFO L226 Difference]: Without dead ends: 379 [2023-11-26 12:04:28,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 12:04:28,815 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 72 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:28,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 621 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 12:04:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-26 12:04:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 245. [2023-11-26 12:04:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 162 states have internal predecessors, (227), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-26 12:04:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 387 transitions. [2023-11-26 12:04:28,857 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 387 transitions. Word has length 220 [2023-11-26 12:04:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:28,858 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 387 transitions. [2023-11-26 12:04:28,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-11-26 12:04:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 387 transitions. [2023-11-26 12:04:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-26 12:04:28,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:28,862 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:28,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:04:28,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:28,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1226515911, now seen corresponding path program 1 times [2023-11-26 12:04:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813228713] [2023-11-26 12:04:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:04:28,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:04:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:04:29,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:04:29,127 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:04:29,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 12:04:29,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:04:29,136 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:29,141 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:04:29,284 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-26 12:04:29,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 12:04:29,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated [2023-11-26 12:04:29,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated [2023-11-26 12:04:29,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated [2023-11-26 12:04:29,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated [2023-11-26 12:04:29,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated [2023-11-26 12:04:29,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated [2023-11-26 12:04:29,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated [2023-11-26 12:04:29,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short29 could not be translated [2023-11-26 12:04:29,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:04:29 BoogieIcfgContainer [2023-11-26 12:04:29,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:04:29,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:04:29,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:04:29,338 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:04:29,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:06" (3/4) ... [2023-11-26 12:04:29,341 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:04:29,342 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:04:29,343 INFO L158 Benchmark]: Toolchain (without parser) took 24264.39ms. Allocated memory was 157.3MB in the beginning and 423.6MB in the end (delta: 266.3MB). Free memory was 126.2MB in the beginning and 248.4MB in the end (delta: -122.2MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,343 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:04:29,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.45ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 111.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.62ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,345 INFO L158 Benchmark]: Boogie Preprocessor took 84.12ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 102.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,345 INFO L158 Benchmark]: RCFGBuilder took 933.36ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 72.8MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,346 INFO L158 Benchmark]: TraceAbstraction took 22652.63ms. Allocated memory was 157.3MB in the beginning and 423.6MB in the end (delta: 266.3MB). Free memory was 72.3MB in the beginning and 248.4MB in the end (delta: -176.0MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2023-11-26 12:04:29,346 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 423.6MB. Free memory is still 248.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:04:29,349 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.32ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.45ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 111.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.62ms. Allocated memory is still 157.3MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.12ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 102.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 933.36ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 72.8MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22652.63ms. Allocated memory was 157.3MB in the beginning and 423.6MB in the end (delta: 266.3MB). Free memory was 72.3MB in the beginning and 248.4MB in the end (delta: -176.0MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 423.6MB. Free memory is still 248.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryArithmeticDOUBLEoperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 100; [L25] unsigned short int var_1_4 = 10; [L26] signed short int var_1_5 = 256; [L27] signed short int var_1_6 = -10; [L28] signed short int var_1_7 = -25; [L29] unsigned short int var_1_8 = 64; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 1; [L32] unsigned short int var_1_11 = 256; [L33] unsigned short int var_1_12 = 0; [L34] unsigned short int var_1_13 = 64; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 8.25; [L39] float var_1_18 = 1.25; [L40] signed char var_1_19 = -100; [L41] double var_1_20 = 100000000.8; [L42] double var_1_21 = 15.125; [L43] double var_1_22 = 99.22; [L44] signed long int var_1_23 = -16; [L45] unsigned char var_1_24 = 1; [L46] signed char var_1_25 = 10; [L47] signed char var_1_26 = 16; [L48] unsigned char var_1_27 = 0; [L49] double var_1_28 = 5.5; [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L96] var_1_3 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L99] var_1_4 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L102] var_1_5 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_6 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L107] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L110] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L111] var_1_9 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L112] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L116] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L117] var_1_11 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L119] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L120] var_1_12 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L122] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L123] var_1_13 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L125] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L127] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L129] var_1_17 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L130] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L131] var_1_18 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L132] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L133] var_1_19 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L134] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L135] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L136] var_1_21 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L137] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L138] var_1_22 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L139] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L140] var_1_25 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L141] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L142] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L144] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L146] var_1_27 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L147] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L148] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L161] RET updateVariables() [L162] CALL step() [L53] unsigned char stepLocal_0 = var_1_4 > 4; VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L54] COND TRUE (var_1_2 <= var_1_3) || stepLocal_0 [L55] var_1_1 = (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))) VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L59] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L64] signed short int stepLocal_1 = var_1_5; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L65] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L65] COND FALSE !(stepLocal_1 > (var_1_4 + (var_1_6 ^ var_1_7))) [L68] unsigned short int stepLocal_3 = var_1_4; [L69] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L70] COND FALSE !(var_1_1 < stepLocal_3) [L81] var_1_16 = 100 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L83] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L84] EXPR ((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L84] COND FALSE !((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) [L87] var_1_23 = ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, stepLocal_2=1, stepLocal_3=5, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_23=100, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L89] var_1_24 = ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27) [L90] var_1_28 = var_1_21 [L162] RET step() [L163] CALL, EXPR property() [L153] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L153] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L153] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L153] EXPR (((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16)))))) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L153-L154] return (((((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))))))) && (var_1_24 == ((unsigned char) ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=5, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-1, var_1_6=0, var_1_7=6, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 2793 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1993 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1293 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 800 mSDtfsCounter, 1293 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 443 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1310 ConstructedInterpolants, 0 QuantifiedInterpolants, 11807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15120/15120 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 12:04:29,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme --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 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:04:32,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:04:32,253 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 12:04:32,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:04:32,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:04:32,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:04:32,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:04:32,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:04:32,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:04:32,318 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:04:32,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:04:32,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:04:32,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:04:32,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:04:32,322 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:04:32,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:04:32,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:04:32,324 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:04:32,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:04:32,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:04:32,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:04:32,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:04:32,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:04:32,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 12:04:32,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 12:04:32,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 12:04:32,328 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:04:32,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:04:32,329 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:04:32,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:04:32,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:04:32,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:04:32,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:04:32,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:32,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:04:32,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:04:32,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:04:32,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 12:04:32,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 12:04:32,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:04:32,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:04:32,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:04:32,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:04:32,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:04:32,337 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 12:04:32,337 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme 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 -> 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 [2023-11-26 12:04:32,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:04:32,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:04:32,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:04:32,799 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:04:32,800 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:04:32,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:35,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:04:36,254 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:04:36,255 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:36,265 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/c64edc7a8/5e8dd167986f489fb40ca1c098cfbb04/FLAG5eb798d25 [2023-11-26 12:04:36,281 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/data/c64edc7a8/5e8dd167986f489fb40ca1c098cfbb04 [2023-11-26 12:04:36,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:04:36,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:04:36,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:36,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:04:36,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:04:36,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b32c0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36, skipping insertion in model container [2023-11-26 12:04:36,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,347 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:04:36,533 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i[917,930] [2023-11-26 12:04:36,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:36,618 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:04:36,630 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i[917,930] [2023-11-26 12:04:36,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:04:36,714 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:04:36,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36 WrapperNode [2023-11-26 12:04:36,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:04:36,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:36,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:04:36,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:04:36,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,787 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2023-11-26 12:04:36,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:04:36,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:04:36,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:04:36,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:04:36,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,868 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 12:04:36,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:04:36,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:04:36,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:04:36,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:04:36,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (1/1) ... [2023-11-26 12:04:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:04:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:04:36,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:04:36,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:04:36,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:04:36,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 12:04:36,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 12:04:36,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 12:04:36,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:04:36,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:04:37,083 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:04:37,085 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:04:39,026 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:04:39,126 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:04:39,126 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:04:39,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:39 BoogieIcfgContainer [2023-11-26 12:04:39,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:04:39,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:04:39,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:04:39,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:04:39,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:04:36" (1/3) ... [2023-11-26 12:04:39,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570d74b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:39, skipping insertion in model container [2023-11-26 12:04:39,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:04:36" (2/3) ... [2023-11-26 12:04:39,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570d74b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:04:39, skipping insertion in model container [2023-11-26 12:04:39,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:04:39" (3/3) ... [2023-11-26 12:04:39,156 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-65.i [2023-11-26 12:04:39,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:04:39,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 12:04:39,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:04:39,256 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51ff3228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:04:39,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 12:04:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:04:39,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-26 12:04:39,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:39,292 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:39,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:39,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1253445999, now seen corresponding path program 1 times [2023-11-26 12:04:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:04:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842144785] [2023-11-26 12:04:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:04:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:04:39,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:04:39,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 12:04:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:39,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 12:04:39,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 12:04:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2023-11-26 12:04:39,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 12:04:39,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 12:04:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842144785] [2023-11-26 12:04:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842144785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:39,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:04:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201606263] [2023-11-26 12:04:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:39,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 12:04:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 12:04:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 12:04:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:04:39,880 INFO L87 Difference]: Start difference. First operand has 80 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:04:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 12:04:40,560 INFO L93 Difference]: Finished difference Result 157 states and 286 transitions. [2023-11-26 12:04:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 12:04:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 213 [2023-11-26 12:04:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 12:04:40,588 INFO L225 Difference]: With dead ends: 157 [2023-11-26 12:04:40,588 INFO L226 Difference]: Without dead ends: 78 [2023-11-26 12:04:40,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 12:04:40,597 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-26 12:04:40,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-26 12:04:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-26 12:04:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-26 12:04:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 12:04:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2023-11-26 12:04:40,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 213 [2023-11-26 12:04:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 12:04:40,660 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2023-11-26 12:04:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-11-26 12:04:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2023-11-26 12:04:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-26 12:04:40,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 12:04:40,667 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:04:40,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 12:04:40,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:04:40,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 12:04:40,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -692833519, now seen corresponding path program 1 times [2023-11-26 12:04:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 12:04:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828078177] [2023-11-26 12:04:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:40,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 12:04:40,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 12:04:40,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 12:04:40,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae410f50-f043-49b2-9306-3e3d15d04c03/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 12:04:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:41,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-26 12:04:41,375 INFO L285 TraceCheckSpWp]: Computing forward predicates...