./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX --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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:54:33,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:54:33,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:54:33,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:54:33,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:54:33,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:54:33,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:54:33,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:54:33,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:54:33,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:54:33,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:54:33,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:54:33,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:54:33,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:54:33,146 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:54:33,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:54:33,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:54:33,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:54:33,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:54:33,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:54:33,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:54:33,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:54:33,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:54:33,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:54:33,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:54:33,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:54:33,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:54:33,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:54:33,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:54:33,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:54:33,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:54:33,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:54:33,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:54:33,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:54:33,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:54:33,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:54:33,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:54:33,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:54:33,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:54:33,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:54:33,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:54:33,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:54:33,159 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_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-08 18:54:33,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:54:33,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:54:33,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:54:33,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:54:33,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:54:33,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i Unable to find full path for "g++" [2024-11-08 18:54:35,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:54:35,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:54:35,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-08 18:54:35,733 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/4c204a8de/ab3969b81c59492bb0812ae500711691/FLAG9461f3c35 [2024-11-08 18:54:36,060 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/4c204a8de/ab3969b81c59492bb0812ae500711691 [2024-11-08 18:54:36,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:54:36,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:54:36,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:54:36,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:54:36,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:54:36,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289b0ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36, skipping insertion in model container [2024-11-08 18:54:36,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:54:36,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-08 18:54:36,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:54:36,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:54:36,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-08 18:54:36,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:54:36,618 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:54:36,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36 WrapperNode [2024-11-08 18:54:36,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:54:36,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:54:36,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:54:36,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:54:36,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,731 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-08 18:54:36,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:54:36,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:54:36,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:54:36,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:54:36,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:54:36,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:54:36,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:54:36,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:54:36,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:54:36,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (1/1) ... [2024-11-08 18:54:36,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:54:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:54:36,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:54:36,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:54:36,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:54:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:54:36,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:54:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:54:36,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:54:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:54:37,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:54:37,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:54:37,859 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-08 18:54:37,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:54:37,879 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:54:37,882 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:54:37,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:54:37 BoogieIcfgContainer [2024-11-08 18:54:37,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:54:37,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:54:37,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:54:37,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:54:37,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:54:36" (1/3) ... [2024-11-08 18:54:37,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3839d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:54:37, skipping insertion in model container [2024-11-08 18:54:37,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:54:36" (2/3) ... [2024-11-08 18:54:37,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3839d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:54:37, skipping insertion in model container [2024-11-08 18:54:37,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:54:37" (3/3) ... [2024-11-08 18:54:37,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-08 18:54:37,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:54:37,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:54:37,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:54:37,995 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@495881b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:54:37,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:54:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:54:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:54:38,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:38,020 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:38,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:54:38,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -663178050, now seen corresponding path program 1 times [2024-11-08 18:54:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:38,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573044848] [2024-11-08 18:54:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:54:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:54:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:54:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:54:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:54:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:54:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:54:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:54:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:54:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:54:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:54:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:54:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:54:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:54:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:54:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:54:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:54:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:54:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:54:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:54:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:54:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:54:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:54:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:54:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:54:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:54:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573044848] [2024-11-08 18:54:38,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573044848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:54:38,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:54:38,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:54:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300376221] [2024-11-08 18:54:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:54:38,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:54:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:54:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:54:38,686 INFO L87 Difference]: Start difference. First operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:54:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:38,720 INFO L93 Difference]: Finished difference Result 185 states and 317 transitions. [2024-11-08 18:54:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:54:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-08 18:54:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:38,733 INFO L225 Difference]: With dead ends: 185 [2024-11-08 18:54:38,734 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 18:54:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:54:38,742 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:38,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:54:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 18:54:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 18:54:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:54:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2024-11-08 18:54:38,814 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 170 [2024-11-08 18:54:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:38,814 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2024-11-08 18:54:38,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:54:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2024-11-08 18:54:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:54:38,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:38,822 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:38,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:54:38,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:54:38,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1660668232, now seen corresponding path program 1 times [2024-11-08 18:54:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507886390] [2024-11-08 18:54:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:54:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:54:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:54:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:54:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:54:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:54:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:54:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:54:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:54:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:54:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:54:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:54:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:54:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:54:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:54:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:54:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:54:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:54:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:54:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:54:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:54:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:54:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:54:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:54:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:54:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:54:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507886390] [2024-11-08 18:54:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507886390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:54:40,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:54:40,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:54:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564767766] [2024-11-08 18:54:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:54:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:54:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:54:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:54:40,163 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:54:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:40,270 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-11-08 18:54:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:54:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 18:54:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:40,277 INFO L225 Difference]: With dead ends: 230 [2024-11-08 18:54:40,277 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 18:54:40,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:54:40,281 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:40,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:54:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 18:54:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-08 18:54:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 18:54:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-08 18:54:40,316 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 170 [2024-11-08 18:54:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:40,317 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-08 18:54:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:54:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-08 18:54:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:54:40,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:40,324 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:54:40,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:54:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 114339130, now seen corresponding path program 1 times [2024-11-08 18:54:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743945381] [2024-11-08 18:54:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:54:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:54:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:54:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:54:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:54:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:54:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:54:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:54:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:54:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:54:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:54:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:54:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:54:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:54:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:54:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:54:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:54:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:54:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:54:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:54:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:54:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:54:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:54:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:54:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:54:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:54:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:54:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:54:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743945381] [2024-11-08 18:54:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743945381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:54:51,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:54:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:54:51,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845658874] [2024-11-08 18:54:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:54:51,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:54:51,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:54:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:54:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:54:51,583 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:54:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:54:57,581 INFO L93 Difference]: Finished difference Result 616 states and 938 transitions. [2024-11-08 18:54:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:54:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 18:54:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:54:57,588 INFO L225 Difference]: With dead ends: 616 [2024-11-08 18:54:57,588 INFO L226 Difference]: Without dead ends: 482 [2024-11-08 18:54:57,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:54:57,591 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 743 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:54:57,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 747 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 18:54:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-08 18:54:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 215. [2024-11-08 18:54:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 155 states have internal predecessors, (217), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:54:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 329 transitions. [2024-11-08 18:54:57,627 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 329 transitions. Word has length 170 [2024-11-08 18:54:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:54:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 329 transitions. [2024-11-08 18:54:57,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:54:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 329 transitions. [2024-11-08 18:54:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:54:57,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:54:57,632 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:54:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:54:57,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:54:57,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:54:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash -143826308, now seen corresponding path program 1 times [2024-11-08 18:54:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:54:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063355583] [2024-11-08 18:54:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:54:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:54:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063355583] [2024-11-08 18:55:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063355583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:55:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107628513] [2024-11-08 18:55:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:55:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:55:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:55:04,337 INFO L87 Difference]: Start difference. First operand 215 states and 329 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:55:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:09,144 INFO L93 Difference]: Finished difference Result 606 states and 928 transitions. [2024-11-08 18:55:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:55:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-08 18:55:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:09,148 INFO L225 Difference]: With dead ends: 606 [2024-11-08 18:55:09,148 INFO L226 Difference]: Without dead ends: 472 [2024-11-08 18:55:09,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:55:09,151 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 622 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:09,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 864 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 18:55:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-08 18:55:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 240. [2024-11-08 18:55:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:55:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-08 18:55:09,188 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-08 18:55:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:09,189 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-08 18:55:09,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:55:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-08 18:55:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 18:55:09,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:09,192 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:55:09,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -896778120, now seen corresponding path program 1 times [2024-11-08 18:55:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:09,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911401380] [2024-11-08 18:55:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:11,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:11,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911401380] [2024-11-08 18:55:11,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911401380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:11,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:55:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494381746] [2024-11-08 18:55:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:11,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:55:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:55:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:55:11,872 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:13,833 INFO L93 Difference]: Finished difference Result 555 states and 853 transitions. [2024-11-08 18:55:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:55:13,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-08 18:55:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:13,838 INFO L225 Difference]: With dead ends: 555 [2024-11-08 18:55:13,839 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 18:55:13,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:55:13,841 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 447 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:13,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 566 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:55:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 18:55:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 240. [2024-11-08 18:55:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 18:55:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-08 18:55:13,870 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-08 18:55:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-08 18:55:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-08 18:55:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 18:55:13,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:13,874 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:13,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:55:13,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1358074627, now seen corresponding path program 1 times [2024-11-08 18:55:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042473804] [2024-11-08 18:55:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:14,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042473804] [2024-11-08 18:55:14,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042473804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:14,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:55:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072501270] [2024-11-08 18:55:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:55:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:14,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:55:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:55:14,110 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:14,277 INFO L93 Difference]: Finished difference Result 568 states and 875 transitions. [2024-11-08 18:55:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:55:14,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-08 18:55:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:14,283 INFO L225 Difference]: With dead ends: 568 [2024-11-08 18:55:14,283 INFO L226 Difference]: Without dead ends: 434 [2024-11-08 18:55:14,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:55:14,288 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 139 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:14,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 415 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:55:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-08 18:55:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 353. [2024-11-08 18:55:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 281 states have (on average 1.4483985765124556) internal successors, (407), 284 states have internal predecessors, (407), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2024-11-08 18:55:14,339 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 171 [2024-11-08 18:55:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:14,340 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2024-11-08 18:55:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2024-11-08 18:55:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 18:55:14,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:14,343 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:14,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:55:14,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1492088133, now seen corresponding path program 1 times [2024-11-08 18:55:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629874067] [2024-11-08 18:55:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629874067] [2024-11-08 18:55:15,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629874067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:15,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:15,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:55:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099901788] [2024-11-08 18:55:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:15,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:55:15,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:15,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:55:15,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:55:15,103 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:15,718 INFO L93 Difference]: Finished difference Result 1032 states and 1556 transitions. [2024-11-08 18:55:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:55:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-08 18:55:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:15,723 INFO L225 Difference]: With dead ends: 1032 [2024-11-08 18:55:15,723 INFO L226 Difference]: Without dead ends: 821 [2024-11-08 18:55:15,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:55:15,725 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 330 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:15,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1131 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:55:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-08 18:55:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 401. [2024-11-08 18:55:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 329 states have (on average 1.4711246200607904) internal successors, (484), 332 states have internal predecessors, (484), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 612 transitions. [2024-11-08 18:55:15,768 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 612 transitions. Word has length 171 [2024-11-08 18:55:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:15,768 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 612 transitions. [2024-11-08 18:55:15,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 612 transitions. [2024-11-08 18:55:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 18:55:15,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:15,772 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:15,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:55:15,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1233922695, now seen corresponding path program 1 times [2024-11-08 18:55:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441609685] [2024-11-08 18:55:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441609685] [2024-11-08 18:55:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441609685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:55:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553209000] [2024-11-08 18:55:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:55:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:55:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:55:18,501 INFO L87 Difference]: Start difference. First operand 401 states and 612 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:20,031 INFO L93 Difference]: Finished difference Result 986 states and 1498 transitions. [2024-11-08 18:55:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:55:20,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-08 18:55:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:20,037 INFO L225 Difference]: With dead ends: 986 [2024-11-08 18:55:20,037 INFO L226 Difference]: Without dead ends: 775 [2024-11-08 18:55:20,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:55:20,039 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 251 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:20,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 581 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 18:55:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-08 18:55:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 441. [2024-11-08 18:55:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 372 states have internal predecessors, (549), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 677 transitions. [2024-11-08 18:55:20,076 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 677 transitions. Word has length 171 [2024-11-08 18:55:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 677 transitions. [2024-11-08 18:55:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 677 transitions. [2024-11-08 18:55:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 18:55:20,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:20,080 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:20,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:55:20,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1934045580, now seen corresponding path program 1 times [2024-11-08 18:55:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:20,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117338191] [2024-11-08 18:55:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:27,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:27,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117338191] [2024-11-08 18:55:27,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117338191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:27,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:55:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594076575] [2024-11-08 18:55:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:27,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:55:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:55:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:55:27,764 INFO L87 Difference]: Start difference. First operand 441 states and 677 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:55:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:34,207 INFO L93 Difference]: Finished difference Result 1439 states and 2189 transitions. [2024-11-08 18:55:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:55:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2024-11-08 18:55:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:34,215 INFO L225 Difference]: With dead ends: 1439 [2024-11-08 18:55:34,215 INFO L226 Difference]: Without dead ends: 1182 [2024-11-08 18:55:34,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2024-11-08 18:55:34,217 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1200 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:34,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 981 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 18:55:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-08 18:55:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 458. [2024-11-08 18:55:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 386 states have (on average 1.494818652849741) internal successors, (577), 389 states have internal predecessors, (577), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 705 transitions. [2024-11-08 18:55:34,263 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 705 transitions. Word has length 171 [2024-11-08 18:55:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:34,263 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 705 transitions. [2024-11-08 18:55:34,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:55:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 705 transitions. [2024-11-08 18:55:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 18:55:34,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:34,267 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:34,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:55:34,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:34,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2102756278, now seen corresponding path program 1 times [2024-11-08 18:55:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:34,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636735530] [2024-11-08 18:55:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636735530] [2024-11-08 18:55:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636735530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:55:37,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159027008] [2024-11-08 18:55:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:37,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:55:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:55:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:55:37,247 INFO L87 Difference]: Start difference. First operand 458 states and 705 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:39,402 INFO L93 Difference]: Finished difference Result 1164 states and 1781 transitions. [2024-11-08 18:55:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:55:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-08 18:55:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:39,406 INFO L225 Difference]: With dead ends: 1164 [2024-11-08 18:55:39,406 INFO L226 Difference]: Without dead ends: 907 [2024-11-08 18:55:39,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:55:39,408 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 269 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:39,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 612 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 18:55:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-08 18:55:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 443. [2024-11-08 18:55:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 371 states have (on average 1.4878706199460916) internal successors, (552), 374 states have internal predecessors, (552), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 680 transitions. [2024-11-08 18:55:39,448 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 680 transitions. Word has length 171 [2024-11-08 18:55:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 680 transitions. [2024-11-08 18:55:39,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 680 transitions. [2024-11-08 18:55:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:55:39,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:39,451 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:55:39,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1385875477, now seen corresponding path program 1 times [2024-11-08 18:55:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798121466] [2024-11-08 18:55:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 18:55:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798121466] [2024-11-08 18:55:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798121466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:55:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872444325] [2024-11-08 18:55:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:55:40,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:55:40,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:55:40,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:55:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:40,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:55:40,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:55:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 18:55:41,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:55:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 18:55:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872444325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:55:41,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:55:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 21 [2024-11-08 18:55:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820440492] [2024-11-08 18:55:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:55:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:55:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:55:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:55:41,768 INFO L87 Difference]: Start difference. First operand 443 states and 680 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-08 18:55:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:46,170 INFO L93 Difference]: Finished difference Result 2256 states and 3315 transitions. [2024-11-08 18:55:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-08 18:55:46,171 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 172 [2024-11-08 18:55:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:46,179 INFO L225 Difference]: With dead ends: 2256 [2024-11-08 18:55:46,179 INFO L226 Difference]: Without dead ends: 1919 [2024-11-08 18:55:46,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1056, Invalid=6254, Unknown=0, NotChecked=0, Total=7310 [2024-11-08 18:55:46,183 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1556 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:46,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1533 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:55:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2024-11-08 18:55:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 606. [2024-11-08 18:55:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 529 states have (on average 1.440453686200378) internal successors, (762), 532 states have internal predecessors, (762), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 890 transitions. [2024-11-08 18:55:46,254 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 890 transitions. Word has length 172 [2024-11-08 18:55:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 890 transitions. [2024-11-08 18:55:46,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-08 18:55:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 890 transitions. [2024-11-08 18:55:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:55:46,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:46,258 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:46,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:55:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:55:46,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1897974569, now seen corresponding path program 1 times [2024-11-08 18:55:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324511979] [2024-11-08 18:55:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 18:55:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324511979] [2024-11-08 18:55:47,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324511979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:55:47,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994234251] [2024-11-08 18:55:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:55:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:55:47,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:55:47,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:55:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:47,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 18:55:47,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:55:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-08 18:55:48,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:55:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 18:55:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994234251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:55:48,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:55:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-08 18:55:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980023301] [2024-11-08 18:55:48,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:55:48,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:55:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:55:48,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:55:48,833 INFO L87 Difference]: Start difference. First operand 606 states and 890 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-08 18:55:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:50,707 INFO L93 Difference]: Finished difference Result 1364 states and 1972 transitions. [2024-11-08 18:55:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-08 18:55:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2024-11-08 18:55:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:50,711 INFO L225 Difference]: With dead ends: 1364 [2024-11-08 18:55:50,711 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 18:55:50,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 18:55:50,714 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 877 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:50,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1181 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 18:55:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 18:55:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 571. [2024-11-08 18:55:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 493 states have (on average 1.4198782961460445) internal successors, (700), 496 states have internal predecessors, (700), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2024-11-08 18:55:50,774 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 172 [2024-11-08 18:55:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:50,774 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2024-11-08 18:55:50,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-08 18:55:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2024-11-08 18:55:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:55:50,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:50,778 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:50,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:55:50,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:55:50,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1161066647, now seen corresponding path program 1 times [2024-11-08 18:55:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612016035] [2024-11-08 18:55:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612016035] [2024-11-08 18:55:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612016035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:55:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609672628] [2024-11-08 18:55:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:51,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:55:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:55:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:55:51,233 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:51,398 INFO L93 Difference]: Finished difference Result 982 states and 1429 transitions. [2024-11-08 18:55:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:55:51,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-08 18:55:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:51,402 INFO L225 Difference]: With dead ends: 982 [2024-11-08 18:55:51,403 INFO L226 Difference]: Without dead ends: 585 [2024-11-08 18:55:51,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:55:51,406 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:51,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 289 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:55:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-08 18:55:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-11-08 18:55:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 501 states have (on average 1.4131736526946108) internal successors, (708), 504 states have internal predecessors, (708), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 836 transitions. [2024-11-08 18:55:51,464 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 836 transitions. Word has length 172 [2024-11-08 18:55:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:51,465 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 836 transitions. [2024-11-08 18:55:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 836 transitions. [2024-11-08 18:55:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 18:55:51,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:51,467 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:51,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:55:51,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:51,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2136461171, now seen corresponding path program 1 times [2024-11-08 18:55:51,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:51,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428822727] [2024-11-08 18:55:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:51,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:53,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:53,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428822727] [2024-11-08 18:55:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428822727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:53,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:53,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 18:55:53,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470633105] [2024-11-08 18:55:53,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:53,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:55:53,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:53,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:55:53,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:55:53,659 INFO L87 Difference]: Start difference. First operand 579 states and 836 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:55,334 INFO L93 Difference]: Finished difference Result 1442 states and 2092 transitions. [2024-11-08 18:55:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:55:55,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-08 18:55:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:55,339 INFO L225 Difference]: With dead ends: 1442 [2024-11-08 18:55:55,339 INFO L226 Difference]: Without dead ends: 1089 [2024-11-08 18:55:55,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:55:55,341 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 225 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:55,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 604 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 18:55:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-08 18:55:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 577. [2024-11-08 18:55:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 499 states have (on average 1.4128256513026052) internal successors, (705), 502 states have internal predecessors, (705), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 18:55:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 833 transitions. [2024-11-08 18:55:55,412 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 833 transitions. Word has length 172 [2024-11-08 18:55:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:55,412 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 833 transitions. [2024-11-08 18:55:55,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 833 transitions. [2024-11-08 18:55:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 18:55:55,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:55,414 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:55,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:55:55,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:55,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash -60259638, now seen corresponding path program 1 times [2024-11-08 18:55:55,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:55,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805309570] [2024-11-08 18:55:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:55:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 18:55:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 18:55:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 18:55:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:55:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 18:55:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:55:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:55:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:55:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 18:55:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:55:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:55:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:55:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:55:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 18:55:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 18:55:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 18:55:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 18:55:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 18:55:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 18:55:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 18:55:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:55:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 18:55:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 18:55:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 18:55:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 18:55:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:55:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805309570] [2024-11-08 18:55:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805309570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:55:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:55:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:55:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356555495] [2024-11-08 18:55:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:55:55,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:55:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:55:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:55:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:55:55,598 INFO L87 Difference]: Start difference. First operand 577 states and 833 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:55:55,836 INFO L93 Difference]: Finished difference Result 1423 states and 2068 transitions. [2024-11-08 18:55:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:55:55,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 173 [2024-11-08 18:55:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:55:55,842 INFO L225 Difference]: With dead ends: 1423 [2024-11-08 18:55:55,843 INFO L226 Difference]: Without dead ends: 1012 [2024-11-08 18:55:55,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:55:55,845 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 133 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:55:55,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 368 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:55:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-08 18:55:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1007. [2024-11-08 18:55:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 884 states have (on average 1.4038461538461537) internal successors, (1241), 890 states have internal predecessors, (1241), 103 states have call successors, (103), 19 states have call predecessors, (103), 19 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-08 18:55:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1447 transitions. [2024-11-08 18:55:55,943 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1447 transitions. Word has length 173 [2024-11-08 18:55:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:55:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1447 transitions. [2024-11-08 18:55:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 18:55:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1447 transitions. [2024-11-08 18:55:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 18:55:55,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:55:55,946 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:55:55,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:55:55,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:55:55,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:55:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -731109854, now seen corresponding path program 1 times [2024-11-08 18:55:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:55:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687717511] [2024-11-08 18:55:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:55:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:55:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924440935] [2024-11-08 18:55:56,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:55:56,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:55:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:55:56,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:55:56,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:55:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:55:56,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 18:55:56,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:55:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 602 proven. 159 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-08 18:55:59,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:56:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 111 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-08 18:56:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:56:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687717511] [2024-11-08 18:56:03,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 18:56:03,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924440935] [2024-11-08 18:56:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924440935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:56:03,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:56:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2024-11-08 18:56:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886367635] [2024-11-08 18:56:03,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:56:03,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 18:56:03,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:56:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 18:56:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 18:56:03,530 INFO L87 Difference]: Start difference. First operand 1007 states and 1447 transitions. Second operand has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-08 18:56:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:23,278 INFO L93 Difference]: Finished difference Result 4589 states and 6359 transitions. [2024-11-08 18:56:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-08 18:56:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) Word has length 173 [2024-11-08 18:56:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:23,294 INFO L225 Difference]: With dead ends: 4589 [2024-11-08 18:56:23,294 INFO L226 Difference]: Without dead ends: 3780 [2024-11-08 18:56:23,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4967 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=3320, Invalid=12682, Unknown=0, NotChecked=0, Total=16002 [2024-11-08 18:56:23,302 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 2331 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:23,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2211 Invalid, 4573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-08 18:56:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-08 18:56:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 1691. [2024-11-08 18:56:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1473 states have (on average 1.3754243041412084) internal successors, (2026), 1483 states have internal predecessors, (2026), 162 states have call successors, (162), 55 states have call predecessors, (162), 55 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-08 18:56:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2350 transitions. [2024-11-08 18:56:23,613 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2350 transitions. Word has length 173 [2024-11-08 18:56:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:23,614 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2350 transitions. [2024-11-08 18:56:23,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-08 18:56:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2350 transitions. [2024-11-08 18:56:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 18:56:23,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:23,617 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:56:23,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:56:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 18:56:23,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:56:23,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash -263042784, now seen corresponding path program 1 times [2024-11-08 18:56:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:56:23,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141403303] [2024-11-08 18:56:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:56:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:56:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908070218] [2024-11-08 18:56:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:24,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:56:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:56:24,502 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:56:24,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:56:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:56:24,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:56:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:56:24,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:56:24,968 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:56:24,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:56:24,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:56:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 18:56:25,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:56:25,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:56:25,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:56:25 BoogieIcfgContainer [2024-11-08 18:56:25,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:56:25,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:56:25,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:56:25,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:56:25,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:54:37" (3/4) ... [2024-11-08 18:56:25,320 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:56:25,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:56:25,322 INFO L158 Benchmark]: Toolchain (without parser) took 109257.23ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 121.7MB in the beginning and 325.0MB in the end (delta: -203.4MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,323 INFO L158 Benchmark]: CDTParser took 1.88ms. Allocated memory is still 107.0MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:56:25,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.07ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 102.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.47ms. Allocated memory is still 161.5MB. Free memory was 102.1MB in the beginning and 93.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,324 INFO L158 Benchmark]: Boogie Preprocessor took 186.15ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 117.0MB in the end (delta: -23.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,324 INFO L158 Benchmark]: RCFGBuilder took 963.69ms. Allocated memory is still 161.5MB. Free memory was 117.0MB in the beginning and 76.7MB in the end (delta: 40.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,325 INFO L158 Benchmark]: TraceAbstraction took 107429.42ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 76.0MB in the beginning and 325.0MB in the end (delta: -249.1MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. [2024-11-08 18:56:25,325 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 539.0MB. Free memory is still 325.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:56:25,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.88ms. Allocated memory is still 107.0MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.07ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 102.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.47ms. Allocated memory is still 161.5MB. Free memory was 102.1MB in the beginning and 93.4MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.15ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 117.0MB in the end (delta: -23.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * RCFGBuilder took 963.69ms. Allocated memory is still 161.5MB. Free memory was 117.0MB in the beginning and 76.7MB in the end (delta: 40.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 107429.42ms. Allocated memory was 161.5MB in the beginning and 539.0MB in the end (delta: 377.5MB). Free memory was 76.0MB in the beginning and 325.0MB in the end (delta: -249.1MB). Peak memory consumption was 131.2MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 539.0MB. Free memory is still 325.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L70] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L72] COND TRUE stepLocal_0 >= var_1_4 [L73] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_4; [L81] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L82] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L89] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L110] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L111] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L112] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L116] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L117] COND TRUE stepLocal_8 || var_1_14 [L118] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.2s, OverallIterations: 17, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9304 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9246 mSDsluCounter, 12627 SdHoareTripleChecker+Invalid, 27.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10335 mSDsCounter, 1320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14115 IncrementalHoareTripleChecker+Invalid, 15435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1320 mSolverCounterUnsat, 2292 mSDtfsCounter, 14115 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1826 SyntacticMatches, 2 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8059 ImplicationChecksByTransitivity, 28.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1691occurred in iteration=16, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 7038 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 48.8s InterpolantComputationTime, 3602 NumberOfCodeBlocks, 3602 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3579 ConstructedInterpolants, 0 QuantifiedInterpolants, 37774 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 24546/25200 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 [2024-11-08 18:56:25,552 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 18:56:25,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX --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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:56:28,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:56:28,280 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:56:28,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:56:28,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:56:28,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:56:28,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:56:28,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:56:28,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:56:28,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:56:28,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:56:28,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:56:28,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:56:28,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:56:28,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:56:28,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:56:28,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:56:28,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:56:28,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:56:28,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:56:28,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:56:28,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:56:28,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:56:28,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:56:28,359 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:56:28,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:56:28,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:56:28,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:56:28,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:56:28,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:56:28,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:56:28,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:56:28,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:56:28,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:56:28,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:56:28,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:56:28,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:56:28,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:56:28,366 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:56:28,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:56:28,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:56:28,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:56:28,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:56:28,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:56:28,370 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_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-08 18:56:28,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:56:28,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:56:28,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:56:28,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:56:28,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:56:28,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i Unable to find full path for "g++" [2024-11-08 18:56:31,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:56:31,481 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:56:31,486 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-08 18:56:31,506 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/f051a22d9/d8cb7d5a49f04feeb38225684bdb145e/FLAG5e7a62932 [2024-11-08 18:56:31,533 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/data/f051a22d9/d8cb7d5a49f04feeb38225684bdb145e [2024-11-08 18:56:31,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:56:31,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:56:31,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:56:31,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:56:31,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:56:31,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:56:31" (1/1) ... [2024-11-08 18:56:31,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560b7c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:31, skipping insertion in model container [2024-11-08 18:56:31,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:56:31" (1/1) ... [2024-11-08 18:56:31,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:56:31,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-08 18:56:32,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:56:32,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:56:32,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-08 18:56:32,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:56:32,227 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:56:32,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32 WrapperNode [2024-11-08 18:56:32,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:56:32,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:56:32,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:56:32,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:56:32,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,297 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-08 18:56:32,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:56:32,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:56:32,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:56:32,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:56:32,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,332 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:56:32,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:56:32,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:56:32,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:56:32,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:56:32,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (1/1) ... [2024-11-08 18:56:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:56:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:56:32,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:56:32,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:56:32,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:56:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:56:32,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:56:32,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:56:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:56:32,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:56:32,598 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:56:32,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:56:46,169 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-08 18:56:46,170 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:56:46,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:56:46,191 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:56:46,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:56:46 BoogieIcfgContainer [2024-11-08 18:56:46,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:56:46,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:56:46,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:56:46,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:56:46,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:56:31" (1/3) ... [2024-11-08 18:56:46,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f21b5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:56:46, skipping insertion in model container [2024-11-08 18:56:46,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:56:32" (2/3) ... [2024-11-08 18:56:46,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f21b5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:56:46, skipping insertion in model container [2024-11-08 18:56:46,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:56:46" (3/3) ... [2024-11-08 18:56:46,201 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-08 18:56:46,221 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:56:46,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:56:46,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:56:46,296 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a2a088d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:56:46,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:56:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:56:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 18:56:46,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:46,324 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:56:46,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:56:46,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:46,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1551552942, now seen corresponding path program 1 times [2024-11-08 18:56:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:56:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11903616] [2024-11-08 18:56:46,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:46,351 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 [2024-11-08 18:56:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:56:46,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 18:56:46,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 18:56:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:47,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:56:47,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:56:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-08 18:56:47,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:56:47,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:56:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11903616] [2024-11-08 18:56:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11903616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:56:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:56:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:56:47,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360565760] [2024-11-08 18:56:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:56:47,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:56:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:56:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:56:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:56:47,832 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:56:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:56:47,876 INFO L93 Difference]: Finished difference Result 163 states and 281 transitions. [2024-11-08 18:56:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:56:47,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-08 18:56:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:56:47,891 INFO L225 Difference]: With dead ends: 163 [2024-11-08 18:56:47,891 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 18:56:47,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:56:47,904 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:56:47,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:56:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 18:56:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 18:56:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:56:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-08 18:56:47,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 167 [2024-11-08 18:56:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:56:47,967 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-08 18:56:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 18:56:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-08 18:56:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 18:56:47,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:56:47,975 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:56:47,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 18:56:48,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 18:56:48,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:56:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:56:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1372094824, now seen corresponding path program 1 times [2024-11-08 18:56:48,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:56:48,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303524772] [2024-11-08 18:56:48,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:56:48,184 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 [2024-11-08 18:56:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:56:48,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 18:56:48,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 18:56:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:56:49,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:56:49,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:56:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-08 18:56:53,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:56:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 18:56:56,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:56:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303524772] [2024-11-08 18:56:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303524772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:56:56,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:56:56,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 18:56:56,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138696517] [2024-11-08 18:56:56,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:56:56,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:56:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:56:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:56:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:56:56,481 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-08 18:57:03,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:07,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:11,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:15,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:19,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:23,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:27,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:30,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:57:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:30,130 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2024-11-08 18:57:30,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:57:30,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 167 [2024-11-08 18:57:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:57:30,280 INFO L225 Difference]: With dead ends: 168 [2024-11-08 18:57:30,281 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:57:30,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:57:30,284 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:57:30,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 301 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 33.1s Time] [2024-11-08 18:57:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:57:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-11-08 18:57:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 18:57:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-08 18:57:30,305 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 167 [2024-11-08 18:57:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:57:30,306 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-08 18:57:30,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-08 18:57:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-08 18:57:30,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 18:57:30,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:57:30,311 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:57:30,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:30,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 18:57:30,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:57:30,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1370247782, now seen corresponding path program 1 times [2024-11-08 18:57:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:57:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103353456] [2024-11-08 18:57:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:30,514 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 [2024-11-08 18:57:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:57:30,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 18:57:30,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (4)] Waiting until timeout for monitored process [2024-11-08 18:57:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:31,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 18:57:31,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 332 proven. 177 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2024-11-08 18:57:47,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:49,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:57:49,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103353456] [2024-11-08 18:57:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103353456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699292126] [2024-11-08 18:57:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:49,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:49,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:49,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:57:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:51,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 18:57:51,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:58:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 332 proven. 177 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2024-11-08 18:58:06,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:58:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699292126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:58:10,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:58:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 17 [2024-11-08 18:58:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022018518] [2024-11-08 18:58:10,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:58:10,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:58:10,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:58:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:58:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:58:10,750 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-08 18:58:30,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:34,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:38,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:42,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:46,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:50,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:54,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:58:57,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:02,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:06,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:10,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:14,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:15,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:21,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:25,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:29,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:33,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:37,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:41,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:45,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:47,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 18:59:54,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 18:59:58,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:02,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:06,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:10,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:14,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:18,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:22,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:26,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:31,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 19:00:38,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:00:42,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:00:46,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:00:50,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:00:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:00:50,604 INFO L93 Difference]: Finished difference Result 377 states and 538 transitions. [2024-11-08 19:00:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 19:00:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 167 [2024-11-08 19:00:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:00:50,744 INFO L225 Difference]: With dead ends: 377 [2024-11-08 19:00:50,744 INFO L226 Difference]: Without dead ends: 295 [2024-11-08 19:00:50,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=464, Invalid=1606, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 19:00:50,748 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 580 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 67 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 154.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:00:50,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 765 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 804 Invalid, 30 Unknown, 0 Unchecked, 154.4s Time] [2024-11-08 19:00:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-08 19:00:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2024-11-08 19:00:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 125 states have internal predecessors, (157), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 19:00:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2024-11-08 19:00:50,791 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 167 [2024-11-08 19:00:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:00:50,792 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2024-11-08 19:00:50,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-08 19:00:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2024-11-08 19:00:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:00:50,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:00:50,796 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:00:50,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (4)] Ended with exit code 0 [2024-11-08 19:00:51,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 19:00:51,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:00:51,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:00:51,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:00:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2016269830, now seen corresponding path program 1 times [2024-11-08 19:00:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:00:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105282658] [2024-11-08 19:00:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:00:51,199 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 [2024-11-08 19:00:51,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:00:51,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 19:00:51,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (6)] Waiting until timeout for monitored process [2024-11-08 19:00:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:00:52,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:00:52,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:00:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-08 19:00:57,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:01:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 19:01:00,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:01:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105282658] [2024-11-08 19:01:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105282658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:01:00,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:01:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-08 19:01:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541934561] [2024-11-08 19:01:00,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:01:00,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:01:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:01:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:01:00,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:01:00,376 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-08 19:01:08,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:12,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:16,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:20,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:24,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:28,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:32,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:36,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:40,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:44,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:48,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:52,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:01:56,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:00,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:04,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:08,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:12,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:16,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:02:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:02:22,874 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2024-11-08 19:02:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 19:02:22,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 168 [2024-11-08 19:02:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:02:22,883 INFO L225 Difference]: With dead ends: 567 [2024-11-08 19:02:22,883 INFO L226 Difference]: Without dead ends: 459 [2024-11-08 19:02:22,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 19:02:22,885 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 357 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 180 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:02:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 552 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 493 Invalid, 18 Unknown, 0 Unchecked, 79.4s Time] [2024-11-08 19:02:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-08 19:02:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 229. [2024-11-08 19:02:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 163 states have internal predecessors, (200), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 19:02:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 308 transitions. [2024-11-08 19:02:22,953 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 308 transitions. Word has length 168 [2024-11-08 19:02:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:02:22,954 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 308 transitions. [2024-11-08 19:02:22,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-08 19:02:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 308 transitions. [2024-11-08 19:02:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:02:22,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:02:22,958 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:02:22,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:02:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 19:02:23,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:02:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:02:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1439238189, now seen corresponding path program 1 times [2024-11-08 19:02:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:02:23,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980766104] [2024-11-08 19:02:23,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:02:23,160 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 [2024-11-08 19:02:23,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:02:23,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 19:02:23,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (7)] Waiting until timeout for monitored process [2024-11-08 19:02:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:02:24,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:02:24,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:02:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2024-11-08 19:02:31,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:02:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 19:02:34,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:02:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980766104] [2024-11-08 19:02:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980766104] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:02:34,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:02:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-08 19:02:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771313930] [2024-11-08 19:02:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:02:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:02:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:02:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:02:34,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:02:34,050 INFO L87 Difference]: Start difference. First operand 229 states and 308 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 19:02:38,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:02:42,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:02:47,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:02:51,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:02:55,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:00,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:04,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:08,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:13,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:17,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:21,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 19:03:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:03:21,271 INFO L93 Difference]: Finished difference Result 420 states and 572 transitions. [2024-11-08 19:03:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:03:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-08 19:03:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:03:21,431 INFO L225 Difference]: With dead ends: 420 [2024-11-08 19:03:21,432 INFO L226 Difference]: Without dead ends: 317 [2024-11-08 19:03:21,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:03:21,434 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 115 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:03:21,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 244 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 47.2s Time] [2024-11-08 19:03:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-08 19:03:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 233. [2024-11-08 19:03:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 166 states have internal predecessors, (204), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 19:03:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 312 transitions. [2024-11-08 19:03:21,477 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 312 transitions. Word has length 168 [2024-11-08 19:03:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:03:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 312 transitions. [2024-11-08 19:03:21,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 19:03:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 312 transitions. [2024-11-08 19:03:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 19:03:21,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:03:21,481 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:03:21,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 19:03:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 19:03:21,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:03:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:03:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1016536363, now seen corresponding path program 1 times [2024-11-08 19:03:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:03:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179881909] [2024-11-08 19:03:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:03:21,684 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 [2024-11-08 19:03:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:03:21,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 19:03:21,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d56703a-d7a1-476a-a0ff-3ab41ef4e568/bin/uautomizer-verify-jihMAELWvX/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 (8)] Waiting until timeout for monitored process [2024-11-08 19:03:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:03:24,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 19:03:24,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:05:09,458 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:05:33,235 WARN L286 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:05:41,797 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:50,301 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:05:58,786 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:07,261 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:15,751 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:24,250 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:32,884 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:41,405 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:49,890 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:06:58,377 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:06,669 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:15,175 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:23,653 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:32,152 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:40,663 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:49,175 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:07:57,711 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:06,280 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:14,753 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:23,250 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:31,797 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:40,325 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:08:48,861 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)