./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl --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 185570da921102f78f3690e06add4388951ffab584f3784f940b1bd02faea88b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:14,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:14,576 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:04:14,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:14,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:14,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:14,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:14,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:14,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:04:14,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:04:14,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:14,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:14,616 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:14,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:14,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:04:14,618 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:14,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:04:14,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:14,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:14,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:04:14,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:04:14,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:04:14,624 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:14,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:04:14,625 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:14,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:14,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:14,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:04:14,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:14,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:14,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:04:14,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:04:14,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:04:14,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:04:14,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:04:14,629 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:04:14,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:04:14,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:04:14,630 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:04:14,630 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_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/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_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl 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 -> 185570da921102f78f3690e06add4388951ffab584f3784f940b1bd02faea88b [2023-11-12 02:04:14,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:04:14,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:04:14,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:04:14,990 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:04:14,991 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:04:14,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:18,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:04:18,394 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:04:18,395 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:18,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/415740515/17f49e9120da403a9ff23dcedea14814/FLAG26ba4d1f4 [2023-11-12 02:04:18,421 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/415740515/17f49e9120da403a9ff23dcedea14814 [2023-11-12 02:04:18,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:04:18,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:04:18,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:18,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:04:18,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:04:18,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e9e749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18, skipping insertion in model container [2023-11-12 02:04:18,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,467 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:04:18,618 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i[915,928] [2023-11-12 02:04:18,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:18,695 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:04:18,719 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i[915,928] [2023-11-12 02:04:18,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:18,812 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:04:18,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18 WrapperNode [2023-11-12 02:04:18,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:18,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:18,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:04:18,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:04:18,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,899 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-12 02:04:18,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:18,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:04:18,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:04:18,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:04:18,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:04:18,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:04:18,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:04:18,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:04:18,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (1/1) ... [2023-11-12 02:04:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:19,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:19,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:04:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:04:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:04:19,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:04:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:04:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:04:19,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:04:19,214 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:04:19,217 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:04:19,682 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:04:19,689 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:04:19,696 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:04:19,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:19 BoogieIcfgContainer [2023-11-12 02:04:19,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:04:19,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:04:19,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:04:19,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:04:19,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:04:18" (1/3) ... [2023-11-12 02:04:19,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3185c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:19, skipping insertion in model container [2023-11-12 02:04:19,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:18" (2/3) ... [2023-11-12 02:04:19,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3185c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:19, skipping insertion in model container [2023-11-12 02:04:19,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:19" (3/3) ... [2023-11-12 02:04:19,713 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:19,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:04:19,734 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:04:19,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:04:19,789 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@46f40e5b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:04:19,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:04:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:19,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:19,810 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:19,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:19,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash -474482412, now seen corresponding path program 1 times [2023-11-12 02:04:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042799251] [2023-11-12 02:04:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042799251] [2023-11-12 02:04:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042799251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:04:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614297912] [2023-11-12 02:04:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:20,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:04:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:20,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:04:20,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:20,331 INFO L87 Difference]: Start difference. First operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:04:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:20,360 INFO L93 Difference]: Finished difference Result 129 states and 214 transitions. [2023-11-12 02:04:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:04:20,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2023-11-12 02:04:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:20,370 INFO L225 Difference]: With dead ends: 129 [2023-11-12 02:04:20,370 INFO L226 Difference]: Without dead ends: 64 [2023-11-12 02:04:20,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:20,404 INFO L413 NwaCegarLoop]: 95 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, 95 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 [2023-11-12 02:04:20,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-12 02:04:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-12 02:04:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2023-11-12 02:04:20,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 116 [2023-11-12 02:04:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:20,477 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2023-11-12 02:04:20,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:04:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2023-11-12 02:04:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:20,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:20,483 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:04:20,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:20,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 780243400, now seen corresponding path program 1 times [2023-11-12 02:04:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518614124] [2023-11-12 02:04:20,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518614124] [2023-11-12 02:04:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518614124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849276387] [2023-11-12 02:04:20,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:20,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:20,920 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:20,995 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2023-11-12 02:04:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:04:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:20,998 INFO L225 Difference]: With dead ends: 151 [2023-11-12 02:04:20,998 INFO L226 Difference]: Without dead ends: 90 [2023-11-12 02:04:20,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:21,001 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:21,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 189 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-12 02:04:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2023-11-12 02:04:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2023-11-12 02:04:21,013 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 116 [2023-11-12 02:04:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:21,015 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2023-11-12 02:04:21,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2023-11-12 02:04:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:21,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:21,018 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:04:21,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:21,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1492718088, now seen corresponding path program 1 times [2023-11-12 02:04:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904439892] [2023-11-12 02:04:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:21,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904439892] [2023-11-12 02:04:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904439892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20388962] [2023-11-12 02:04:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:21,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:04:21,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:21,499 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:21,760 INFO L93 Difference]: Finished difference Result 217 states and 326 transitions. [2023-11-12 02:04:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:04:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:04:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:21,766 INFO L225 Difference]: With dead ends: 217 [2023-11-12 02:04:21,767 INFO L226 Difference]: Without dead ends: 145 [2023-11-12 02:04:21,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:21,775 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 174 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:21,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 174 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:04:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-12 02:04:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 95. [2023-11-12 02:04:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 77 states have internal predecessors, (110), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2023-11-12 02:04:21,816 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 116 [2023-11-12 02:04:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:21,819 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2023-11-12 02:04:21,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2023-11-12 02:04:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:21,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:21,828 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:21,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:04:21,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:21,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2079524102, now seen corresponding path program 1 times [2023-11-12 02:04:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316957523] [2023-11-12 02:04:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316957523] [2023-11-12 02:04:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316957523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:22,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:04:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604474874] [2023-11-12 02:04:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:22,326 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:22,701 INFO L93 Difference]: Finished difference Result 239 states and 355 transitions. [2023-11-12 02:04:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:22,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:04:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:22,704 INFO L225 Difference]: With dead ends: 239 [2023-11-12 02:04:22,705 INFO L226 Difference]: Without dead ends: 147 [2023-11-12 02:04:22,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:04:22,707 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:22,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 258 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-12 02:04:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2023-11-12 02:04:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2023-11-12 02:04:22,728 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 116 [2023-11-12 02:04:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:22,728 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2023-11-12 02:04:22,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2023-11-12 02:04:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:22,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:22,731 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:22,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:04:22,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:22,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash 212854410, now seen corresponding path program 1 times [2023-11-12 02:04:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252349070] [2023-11-12 02:04:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252349070] [2023-11-12 02:04:23,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252349070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:23,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698616273] [2023-11-12 02:04:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:23,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:04:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:23,172 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:23,506 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2023-11-12 02:04:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:04:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:04:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:23,509 INFO L225 Difference]: With dead ends: 279 [2023-11-12 02:04:23,510 INFO L226 Difference]: Without dead ends: 185 [2023-11-12 02:04:23,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:23,511 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 202 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:23,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 104 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-12 02:04:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 99. [2023-11-12 02:04:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 146 transitions. [2023-11-12 02:04:23,533 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 146 transitions. Word has length 116 [2023-11-12 02:04:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:23,534 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 146 transitions. [2023-11-12 02:04:23,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 146 transitions. [2023-11-12 02:04:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:04:23,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:23,536 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:23,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:04:23,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:23,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash 799660424, now seen corresponding path program 1 times [2023-11-12 02:04:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589521598] [2023-11-12 02:04:23,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589521598] [2023-11-12 02:04:24,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589521598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:24,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:24,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:04:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108634087] [2023-11-12 02:04:24,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:24,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:04:24,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:24,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:04:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:04:24,005 INFO L87 Difference]: Start difference. First operand 99 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:24,412 INFO L93 Difference]: Finished difference Result 260 states and 382 transitions. [2023-11-12 02:04:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:04:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-12 02:04:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:24,414 INFO L225 Difference]: With dead ends: 260 [2023-11-12 02:04:24,415 INFO L226 Difference]: Without dead ends: 164 [2023-11-12 02:04:24,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:04:24,416 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 88 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:24,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 542 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-12 02:04:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 111. [2023-11-12 02:04:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-12 02:04:24,443 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 116 [2023-11-12 02:04:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:24,444 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-12 02:04:24,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-12 02:04:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:24,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:24,446 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:24,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:04:24,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:24,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2102985976, now seen corresponding path program 1 times [2023-11-12 02:04:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148914529] [2023-11-12 02:04:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148914529] [2023-11-12 02:04:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148914529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:04:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883091870] [2023-11-12 02:04:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:25,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:04:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:04:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:04:25,163 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:26,272 INFO L93 Difference]: Finished difference Result 485 states and 707 transitions. [2023-11-12 02:04:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:04:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:26,276 INFO L225 Difference]: With dead ends: 485 [2023-11-12 02:04:26,276 INFO L226 Difference]: Without dead ends: 377 [2023-11-12 02:04:26,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:04:26,278 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 282 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:26,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 465 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:04:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-12 02:04:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 234. [2023-11-12 02:04:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.407035175879397) internal successors, (280), 199 states have internal predecessors, (280), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 344 transitions. [2023-11-12 02:04:26,352 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 344 transitions. Word has length 117 [2023-11-12 02:04:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:26,353 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 344 transitions. [2023-11-12 02:04:26,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 344 transitions. [2023-11-12 02:04:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:26,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:26,355 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:26,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:04:26,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:26,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash 912117642, now seen corresponding path program 1 times [2023-11-12 02:04:26,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796518477] [2023-11-12 02:04:26,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796518477] [2023-11-12 02:04:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796518477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:04:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043412064] [2023-11-12 02:04:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:26,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:26,618 INFO L87 Difference]: Start difference. First operand 234 states and 344 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:26,766 INFO L93 Difference]: Finished difference Result 459 states and 676 transitions. [2023-11-12 02:04:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:26,769 INFO L225 Difference]: With dead ends: 459 [2023-11-12 02:04:26,770 INFO L226 Difference]: Without dead ends: 228 [2023-11-12 02:04:26,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:04:26,772 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 79 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:26,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 334 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:04:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-12 02:04:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2023-11-12 02:04:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 191 states have (on average 1.4031413612565444) internal successors, (268), 191 states have internal predecessors, (268), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2023-11-12 02:04:26,848 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 117 [2023-11-12 02:04:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:26,848 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2023-11-12 02:04:26,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2023-11-12 02:04:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:26,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:26,851 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:26,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:04:26,851 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:26,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1170912966, now seen corresponding path program 1 times [2023-11-12 02:04:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:26,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795173850] [2023-11-12 02:04:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795173850] [2023-11-12 02:04:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795173850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:04:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075692742] [2023-11-12 02:04:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:27,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:04:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:27,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:04:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:04:27,497 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:27,926 INFO L93 Difference]: Finished difference Result 483 states and 708 transitions. [2023-11-12 02:04:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:04:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:27,929 INFO L225 Difference]: With dead ends: 483 [2023-11-12 02:04:27,929 INFO L226 Difference]: Without dead ends: 260 [2023-11-12 02:04:27,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:04:27,931 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:27,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 315 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-12 02:04:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2023-11-12 02:04:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 187 states have (on average 1.3689839572192513) internal successors, (256), 187 states have internal predecessors, (256), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 320 transitions. [2023-11-12 02:04:27,995 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 320 transitions. Word has length 117 [2023-11-12 02:04:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:27,996 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 320 transitions. [2023-11-12 02:04:27,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 320 transitions. [2023-11-12 02:04:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:27,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:27,998 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:27,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:04:27,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:27,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 384823444, now seen corresponding path program 1 times [2023-11-12 02:04:27,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:27,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927921486] [2023-11-12 02:04:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927921486] [2023-11-12 02:04:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927921486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201906767] [2023-11-12 02:04:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:28,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:28,139 INFO L87 Difference]: Start difference. First operand 222 states and 320 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:28,321 INFO L93 Difference]: Finished difference Result 545 states and 786 transitions. [2023-11-12 02:04:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:28,324 INFO L225 Difference]: With dead ends: 545 [2023-11-12 02:04:28,324 INFO L226 Difference]: Without dead ends: 326 [2023-11-12 02:04:28,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:28,326 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 69 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:28,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 221 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-12 02:04:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 229. [2023-11-12 02:04:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 194 states have internal predecessors, (264), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 328 transitions. [2023-11-12 02:04:28,426 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 328 transitions. Word has length 117 [2023-11-12 02:04:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:28,429 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 328 transitions. [2023-11-12 02:04:28,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 328 transitions. [2023-11-12 02:04:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:28,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:28,432 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:28,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:04:28,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:28,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -53732597, now seen corresponding path program 1 times [2023-11-12 02:04:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649168698] [2023-11-12 02:04:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:28,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649168698] [2023-11-12 02:04:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649168698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208064335] [2023-11-12 02:04:28,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:28,577 INFO L87 Difference]: Start difference. First operand 229 states and 328 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:28,802 INFO L93 Difference]: Finished difference Result 541 states and 775 transitions. [2023-11-12 02:04:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:28,806 INFO L225 Difference]: With dead ends: 541 [2023-11-12 02:04:28,806 INFO L226 Difference]: Without dead ends: 315 [2023-11-12 02:04:28,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:28,808 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 74 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:28,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 186 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-12 02:04:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 220. [2023-11-12 02:04:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.345945945945946) internal successors, (249), 185 states have internal predecessors, (249), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 313 transitions. [2023-11-12 02:04:28,922 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 313 transitions. Word has length 117 [2023-11-12 02:04:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:28,923 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 313 transitions. [2023-11-12 02:04:28,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 313 transitions. [2023-11-12 02:04:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:28,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:28,926 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:28,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:04:28,926 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:28,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1769279494, now seen corresponding path program 1 times [2023-11-12 02:04:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172805261] [2023-11-12 02:04:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:28,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172805261] [2023-11-12 02:04:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172805261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:04:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75831638] [2023-11-12 02:04:29,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:29,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:04:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:04:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:04:29,544 INFO L87 Difference]: Start difference. First operand 220 states and 313 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:30,102 INFO L93 Difference]: Finished difference Result 530 states and 735 transitions. [2023-11-12 02:04:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:04:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:30,106 INFO L225 Difference]: With dead ends: 530 [2023-11-12 02:04:30,106 INFO L226 Difference]: Without dead ends: 313 [2023-11-12 02:04:30,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:04:30,107 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 118 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:30,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-12 02:04:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 221. [2023-11-12 02:04:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 186 states have (on average 1.2741935483870968) internal successors, (237), 186 states have internal predecessors, (237), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 301 transitions. [2023-11-12 02:04:30,184 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 301 transitions. Word has length 117 [2023-11-12 02:04:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:30,185 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 301 transitions. [2023-11-12 02:04:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 301 transitions. [2023-11-12 02:04:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-12 02:04:30,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:30,187 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:30,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:04:30,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:30,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 748211140, now seen corresponding path program 1 times [2023-11-12 02:04:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164226591] [2023-11-12 02:04:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164226591] [2023-11-12 02:04:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164226591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:30,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:04:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296863514] [2023-11-12 02:04:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:30,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:04:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:04:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:04:30,803 INFO L87 Difference]: Start difference. First operand 221 states and 301 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:31,380 INFO L93 Difference]: Finished difference Result 432 states and 572 transitions. [2023-11-12 02:04:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:04:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-12 02:04:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:31,384 INFO L225 Difference]: With dead ends: 432 [2023-11-12 02:04:31,384 INFO L226 Difference]: Without dead ends: 315 [2023-11-12 02:04:31,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:04:31,386 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 87 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:31,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 528 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:04:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-12 02:04:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 218. [2023-11-12 02:04:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 183 states have (on average 1.278688524590164) internal successors, (234), 183 states have internal predecessors, (234), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 298 transitions. [2023-11-12 02:04:31,465 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 298 transitions. Word has length 117 [2023-11-12 02:04:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:31,467 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 298 transitions. [2023-11-12 02:04:31,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 298 transitions. [2023-11-12 02:04:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:04:31,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:31,469 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:31,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:04:31,469 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:31,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash -487215891, now seen corresponding path program 1 times [2023-11-12 02:04:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026986069] [2023-11-12 02:04:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026986069] [2023-11-12 02:04:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026986069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:32,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:32,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:04:32,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536133029] [2023-11-12 02:04:32,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:32,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:04:32,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:04:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:04:32,041 INFO L87 Difference]: Start difference. First operand 218 states and 298 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:32,922 INFO L93 Difference]: Finished difference Result 535 states and 733 transitions. [2023-11-12 02:04:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:04:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:04:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:32,925 INFO L225 Difference]: With dead ends: 535 [2023-11-12 02:04:32,925 INFO L226 Difference]: Without dead ends: 320 [2023-11-12 02:04:32,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:04:32,927 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 232 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:32,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 477 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:04:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-12 02:04:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 226. [2023-11-12 02:04:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 191 states have (on average 1.2774869109947644) internal successors, (244), 191 states have internal predecessors, (244), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2023-11-12 02:04:33,004 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 308 transitions. Word has length 118 [2023-11-12 02:04:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:33,004 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 308 transitions. [2023-11-12 02:04:33,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 308 transitions. [2023-11-12 02:04:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:04:33,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:33,007 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:33,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:04:33,007 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:33,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash 42199555, now seen corresponding path program 1 times [2023-11-12 02:04:33,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:33,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729037260] [2023-11-12 02:04:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:04:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:04:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:04:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:04:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:04:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:04:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:04:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:04:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:04:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:04:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-12 02:04:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:04:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:04:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-12 02:04:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:04:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729037260] [2023-11-12 02:04:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729037260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298755905] [2023-11-12 02:04:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:33,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:33,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:33,126 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:33,284 INFO L93 Difference]: Finished difference Result 582 states and 789 transitions. [2023-11-12 02:04:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-12 02:04:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:33,287 INFO L225 Difference]: With dead ends: 582 [2023-11-12 02:04:33,287 INFO L226 Difference]: Without dead ends: 359 [2023-11-12 02:04:33,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:33,291 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:33,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 173 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-11-12 02:04:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 267. [2023-11-12 02:04:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 232 states have (on average 1.2543103448275863) internal successors, (291), 232 states have internal predecessors, (291), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-12 02:04:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 355 transitions. [2023-11-12 02:04:33,380 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 355 transitions. Word has length 118 [2023-11-12 02:04:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:33,381 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 355 transitions. [2023-11-12 02:04:33,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 355 transitions. [2023-11-12 02:04:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-12 02:04:33,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:33,383 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:33,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:04:33,384 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:33,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 99457857, now seen corresponding path program 1 times [2023-11-12 02:04:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931793642] [2023-11-12 02:04:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:33,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:33,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:33,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:33,576 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:04:33,577 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:04:33,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:04:33,583 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:33,587 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:04:33,658 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:04:33,660 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-12 02:04:33,661 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:04:33,661 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:04:33,662 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:04:33,662 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:04:33,662 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:04:33,662 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-12 02:04:33,663 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-12 02:04:33,663 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-12 02:04:33,663 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-12 02:04:33,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:04:33 BoogieIcfgContainer [2023-11-12 02:04:33,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:04:33,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:04:33,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:04:33,688 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:04:33,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:19" (3/4) ... [2023-11-12 02:04:33,691 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:04:33,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:04:33,693 INFO L158 Benchmark]: Toolchain (without parser) took 15267.61ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 139.0MB in the beginning and 217.8MB in the end (delta: -78.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,693 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 83.0MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:04:33,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.15ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 124.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.52ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 120.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,695 INFO L158 Benchmark]: Boogie Preprocessor took 58.64ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,696 INFO L158 Benchmark]: RCFGBuilder took 740.82ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 96.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,696 INFO L158 Benchmark]: TraceAbstraction took 13983.66ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 95.9MB in the beginning and 217.8MB in the end (delta: -121.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2023-11-12 02:04:33,696 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 299.9MB. Free memory is still 217.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:04:33,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 83.0MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.15ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 124.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.52ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 120.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.64ms. Allocated memory is still 172.0MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 740.82ms. Allocated memory is still 172.0MB. Free memory was 118.2MB in the beginning and 96.7MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13983.66ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 95.9MB in the beginning and 217.8MB in the end (delta: -121.9MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 299.9MB. Free memory is still 217.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=68, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1812 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1812 mSDsluCounter, 4497 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2702 mSDsCounter, 373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1893 IncrementalHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 373 mSolverCounterUnsat, 1795 mSDtfsCounter, 1893 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=15, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 1004 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 4741 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 7200/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:04:33,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl --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 185570da921102f78f3690e06add4388951ffab584f3784f940b1bd02faea88b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:36,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:36,530 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:04:36,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:36,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:36,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:36,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:36,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:36,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:04:36,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:04:36,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:36,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:36,594 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:36,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:36,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:04:36,597 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:36,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:36,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:36,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:04:36,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:04:36,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:04:36,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:04:36,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:04:36,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:04:36,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:36,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:04:36,602 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:36,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:36,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:36,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:04:36,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:36,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:36,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:04:36,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:04:36,606 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:04:36,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:04:36,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:04:36,607 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:04:36,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:04:36,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:04:36,609 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:04:36,609 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:04:36,610 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_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/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_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl 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 -> 185570da921102f78f3690e06add4388951ffab584f3784f940b1bd02faea88b [2023-11-12 02:04:37,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:04:37,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:04:37,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:04:37,075 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:04:37,076 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:04:37,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:40,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:04:40,463 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:04:40,464 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:40,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/a4159901a/fe476448898c4e26b67f3aed01de7574/FLAGbf9e0dacd [2023-11-12 02:04:40,488 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/data/a4159901a/fe476448898c4e26b67f3aed01de7574 [2023-11-12 02:04:40,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:04:40,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:04:40,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:40,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:04:40,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:04:40,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:40,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8a325e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40, skipping insertion in model container [2023-11-12 02:04:40,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:40,555 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:04:40,725 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i[915,928] [2023-11-12 02:04:40,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:40,853 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:04:40,870 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-63.i[915,928] [2023-11-12 02:04:40,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:40,968 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:04:40,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40 WrapperNode [2023-11-12 02:04:40,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:40,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:40,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:04:40,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:04:40,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,054 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2023-11-12 02:04:41,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:41,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:04:41,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:04:41,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:04:41,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:04:41,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:04:41,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:04:41,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:04:41,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (1/1) ... [2023-11-12 02:04:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:41,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:41,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:41,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:04:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:04:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:04:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:04:41,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:04:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:04:41,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:04:41,368 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:04:41,370 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:04:46,048 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:04:46,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:04:46,056 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:04:46,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:46 BoogieIcfgContainer [2023-11-12 02:04:46,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:04:46,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:04:46,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:04:46,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:04:46,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:04:40" (1/3) ... [2023-11-12 02:04:46,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d110267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:46, skipping insertion in model container [2023-11-12 02:04:46,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:40" (2/3) ... [2023-11-12 02:04:46,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d110267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:46, skipping insertion in model container [2023-11-12 02:04:46,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:46" (3/3) ... [2023-11-12 02:04:46,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-63.i [2023-11-12 02:04:46,088 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:04:46,089 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:04:46,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:04:46,170 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d4a406a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:04:46,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:04:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:04:46,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:46,191 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:46,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:46,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 784188602, now seen corresponding path program 1 times [2023-11-12 02:04:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:04:46,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327586833] [2023-11-12 02:04:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:04:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:04:46,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:04:46,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 02:04:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:46,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:04:46,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-11-12 02:04:46,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:04:46,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:04:46,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327586833] [2023-11-12 02:04:46,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327586833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:04:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697094863] [2023-11-12 02:04:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:46,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:04:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:04:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:04:47,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:47,009 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:04:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:47,057 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2023-11-12 02:04:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:04:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2023-11-12 02:04:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:47,070 INFO L225 Difference]: With dead ends: 109 [2023-11-12 02:04:47,070 INFO L226 Difference]: Without dead ends: 54 [2023-11-12 02:04:47,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:47,079 INFO L413 NwaCegarLoop]: 78 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, 78 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 [2023-11-12 02:04:47,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:04:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-12 02:04:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-12 02:04:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2023-11-12 02:04:47,146 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2023-11-12 02:04:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:47,147 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2023-11-12 02:04:47,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:04:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2023-11-12 02:04:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:04:47,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:47,155 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:47,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/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)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:47,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:04:47,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:47,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1409610862, now seen corresponding path program 1 times [2023-11-12 02:04:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:04:47,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495091618] [2023-11-12 02:04:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:47,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:04:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:04:47,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:04:47,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-12 02:04:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:47,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:04:47,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-12 02:04:47,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:04:47,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:04:47,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495091618] [2023-11-12 02:04:47,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495091618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:47,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:47,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:47,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658765748] [2023-11-12 02:04:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:47,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:04:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:04:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:47,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:47,973 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:49,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:04:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:50,066 INFO L93 Difference]: Finished difference Result 121 states and 175 transitions. [2023-11-12 02:04:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-11-12 02:04:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:50,070 INFO L225 Difference]: With dead ends: 121 [2023-11-12 02:04:50,070 INFO L226 Difference]: Without dead ends: 70 [2023-11-12 02:04:50,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:50,073 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:50,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-12 02:04:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-12 02:04:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2023-11-12 02:04:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:04:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2023-11-12 02:04:50,086 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 110 [2023-11-12 02:04:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:50,088 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2023-11-12 02:04:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-12 02:04:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2023-11-12 02:04:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-12 02:04:50,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:50,091 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:50,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/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)] Ended with exit code 0 [2023-11-12 02:04:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:04:50,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:50,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1926126418, now seen corresponding path program 1 times [2023-11-12 02:04:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:04:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115225847] [2023-11-12 02:04:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:04:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:04:50,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f02018-806f-4aa7-a45b-4b7f2e1a24cd/bin/uautomizer-verify-uTZkv6EMXl/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 [2023-11-12 02:04:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:50,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-12 02:04:50,761 INFO L285 TraceCheckSpWp]: Computing forward predicates...