./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.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_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/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 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:06:47,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:06:47,555 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:06:47,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:06:47,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:06:47,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:06:47,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:06:47,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:06:47,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:06:47,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:06:47,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:06:47,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:06:47,640 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:06:47,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:06:47,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:06:47,642 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:06:47,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:06:47,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:06:47,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:06:47,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:06:47,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:06:47,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:06:47,646 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:06:47,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:06:47,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:06:47,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:06:47,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:06:47,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:06:47,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:47,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:06:47,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:06:47,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:06:47,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:06:47,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:06:47,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:06:47,652 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:06:47,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:06:47,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:06:47,653 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:06:47,653 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_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/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 -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2023-11-12 02:06:47,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:06:47,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:06:47,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:06:47,985 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:06:47,985 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:06:47,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:06:51,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:06:51,447 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:06:51,447 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:06:51,458 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/7abc7fcbc/e0915c96a7234ea8b48f60ecf3aefd43/FLAG21942afda [2023-11-12 02:06:51,474 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/7abc7fcbc/e0915c96a7234ea8b48f60ecf3aefd43 [2023-11-12 02:06:51,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:06:51,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:06:51,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:51,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:06:51,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:06:51,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b916e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51, skipping insertion in model container [2023-11-12 02:06:51,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:06:51,698 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_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-12 02:06:51,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:51,786 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:06:51,797 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_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-12 02:06:51,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:51,845 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:06:51,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51 WrapperNode [2023-11-12 02:06:51,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:51,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:51,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:06:51,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:06:51,856 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:06:51" (1/1) ... [2023-11-12 02:06:51,867 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:06:51" (1/1) ... [2023-11-12 02:06:51,928 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-11-12 02:06:51,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:51,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:06:51,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:06:51,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:06:51,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:51,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:52,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:06:52,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:06:52,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:06:52,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:06:52,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (1/1) ... [2023-11-12 02:06:52,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:52,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:06:52,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:06:52,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:06:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:06:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:06:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:06:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:06:52,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:06:52,217 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:06:52,219 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:06:52,621 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:06:52,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:06:52,629 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:06:52,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:52 BoogieIcfgContainer [2023-11-12 02:06:52,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:06:52,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:06:52,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:06:52,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:06:52,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:06:51" (1/3) ... [2023-11-12 02:06:52,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0b8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:52, skipping insertion in model container [2023-11-12 02:06:52,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:51" (2/3) ... [2023-11-12 02:06:52,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0b8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:52, skipping insertion in model container [2023-11-12 02:06:52,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:52" (3/3) ... [2023-11-12 02:06:52,642 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:06:52,663 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:06:52,664 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:06:52,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:06:52,725 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;@477de1d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:06:52,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:06:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:06:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-12 02:06:52,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:52,749 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:52,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:52,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2023-11-12 02:06:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193500828] [2023-11-12 02:06:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:06:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:53,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193500828] [2023-11-12 02:06:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193500828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:53,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:06:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617027642] [2023-11-12 02:06:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:53,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:06:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:06:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:06:53,409 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:06:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:53,466 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2023-11-12 02:06:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:06:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2023-11-12 02:06:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:53,482 INFO L225 Difference]: With dead ends: 127 [2023-11-12 02:06:53,482 INFO L226 Difference]: Without dead ends: 63 [2023-11-12 02:06:53,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:06:53,493 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:06:53,495 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:06:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-12 02:06:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-12 02:06:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:06:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2023-11-12 02:06:53,568 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2023-11-12 02:06:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:53,569 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2023-11-12 02:06:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:06:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2023-11-12 02:06:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-12 02:06:53,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:53,583 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:06:53,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:53,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2023-11-12 02:06:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718006135] [2023-11-12 02:06:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:06:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718006135] [2023-11-12 02:06:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718006135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:54,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251160517] [2023-11-12 02:06:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:54,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:54,467 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:54,658 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2023-11-12 02:06:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:06:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2023-11-12 02:06:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:54,663 INFO L225 Difference]: With dead ends: 184 [2023-11-12 02:06:54,663 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 02:06:54,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:06:54,666 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:54,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 261 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:06:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 02:06:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-11-12 02:06:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:06:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2023-11-12 02:06:54,700 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2023-11-12 02:06:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:54,702 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2023-11-12 02:06:54,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2023-11-12 02:06:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-12 02:06:54,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:54,705 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:54,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:06:54,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:54,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2023-11-12 02:06:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390855867] [2023-11-12 02:06:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:06:55,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:55,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390855867] [2023-11-12 02:06:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390855867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:55,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:55,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323556297] [2023-11-12 02:06:55,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:55,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:06:55,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:06:55,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:06:55,403 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:55,729 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2023-11-12 02:06:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2023-11-12 02:06:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:55,740 INFO L225 Difference]: With dead ends: 230 [2023-11-12 02:06:55,740 INFO L226 Difference]: Without dead ends: 170 [2023-11-12 02:06:55,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:06:55,751 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 103 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:55,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:06:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-12 02:06:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2023-11-12 02:06:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-12 02:06:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2023-11-12 02:06:55,824 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2023-11-12 02:06:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:55,830 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2023-11-12 02:06:55,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2023-11-12 02:06:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-12 02:06:55,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:55,834 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:55,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:06:55,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:55,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1205819797, now seen corresponding path program 1 times [2023-11-12 02:06:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468228514] [2023-11-12 02:06:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:06:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468228514] [2023-11-12 02:06:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468228514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556679093] [2023-11-12 02:06:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:56,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:56,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:56,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:56,204 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:06:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:56,440 INFO L93 Difference]: Finished difference Result 397 states and 609 transitions. [2023-11-12 02:06:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:06:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2023-11-12 02:06:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:56,447 INFO L225 Difference]: With dead ends: 397 [2023-11-12 02:06:56,447 INFO L226 Difference]: Without dead ends: 279 [2023-11-12 02:06:56,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:06:56,450 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:56,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:06:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-12 02:06:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2023-11-12 02:06:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-12 02:06:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2023-11-12 02:06:56,514 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 137 [2023-11-12 02:06:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:56,515 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2023-11-12 02:06:56,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:06:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2023-11-12 02:06:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-12 02:06:56,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:56,518 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:56,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:06:56,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:56,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 812792787, now seen corresponding path program 1 times [2023-11-12 02:06:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:56,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413657092] [2023-11-12 02:06:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:06:56,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413657092] [2023-11-12 02:06:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413657092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:56,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:56,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:06:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470931397] [2023-11-12 02:06:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:56,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:06:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:06:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:06:56,868 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:56,930 INFO L93 Difference]: Finished difference Result 511 states and 785 transitions. [2023-11-12 02:06:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:06:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2023-11-12 02:06:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:56,934 INFO L225 Difference]: With dead ends: 511 [2023-11-12 02:06:56,934 INFO L226 Difference]: Without dead ends: 277 [2023-11-12 02:06:56,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 1 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:06:56,936 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:56,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-12 02:06:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2023-11-12 02:06:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2023-11-12 02:06:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2023-11-12 02:06:57,003 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 137 [2023-11-12 02:06:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:57,005 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2023-11-12 02:06:57,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:06:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2023-11-12 02:06:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-12 02:06:57,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:57,008 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:57,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:06:57,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:57,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 463284182, now seen corresponding path program 1 times [2023-11-12 02:06:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745091019] [2023-11-12 02:06:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:06:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745091019] [2023-11-12 02:06:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745091019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:06:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296532360] [2023-11-12 02:06:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:57,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:06:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:57,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:06:57,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:06:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:57,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:06:57,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:06:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-11-12 02:06:57,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:06:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:06:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296532360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:06:58,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:06:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-12 02:06:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852181814] [2023-11-12 02:06:58,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:06:58,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:06:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:06:58,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:06:58,087 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-12 02:06:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:58,301 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2023-11-12 02:06:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:06:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 138 [2023-11-12 02:06:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:58,305 INFO L225 Difference]: With dead ends: 425 [2023-11-12 02:06:58,305 INFO L226 Difference]: Without dead ends: 307 [2023-11-12 02:06:58,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:06:58,311 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:58,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:06:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-12 02:06:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 173. [2023-11-12 02:06:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-11-12 02:06:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2023-11-12 02:06:58,368 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2023-11-12 02:06:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:58,369 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2023-11-12 02:06:58,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-11-12 02:06:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2023-11-12 02:06:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-12 02:06:58,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:58,373 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:58,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:06:58,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 02:06:58,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:58,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 70257172, now seen corresponding path program 1 times [2023-11-12 02:06:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:58,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810584160] [2023-11-12 02:06:58,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:58,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:06:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:06:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:06:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:06:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:06:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:06:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:06:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:06:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:06:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:06:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:06:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:06:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-12 02:06:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:06:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-12 02:06:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:06:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:06:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:06:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810584160] [2023-11-12 02:06:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810584160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:06:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573640644] [2023-11-12 02:06:59,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:59,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:06:59,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:59,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:06:59,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:06:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:59,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:06:59,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:06:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-11-12 02:06:59,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:06:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-11-12 02:06:59,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573640644] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:06:59,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:06:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-12 02:06:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649799704] [2023-11-12 02:06:59,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:06:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:06:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:06:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:06:59,615 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-12 02:07:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:00,394 INFO L93 Difference]: Finished difference Result 435 states and 605 transitions. [2023-11-12 02:07:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 02:07:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2023-11-12 02:07:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:00,398 INFO L225 Difference]: With dead ends: 435 [2023-11-12 02:07:00,399 INFO L226 Difference]: Without dead ends: 371 [2023-11-12 02:07:00,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:07:00,401 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 197 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:00,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 386 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:07:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-12 02:07:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2023-11-12 02:07:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.14375) internal successors, (183), 162 states have internal predecessors, (183), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2023-11-12 02:07:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2023-11-12 02:07:00,491 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 138 [2023-11-12 02:07:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:00,491 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2023-11-12 02:07:00,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-12 02:07:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2023-11-12 02:07:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-12 02:07:00,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:00,494 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:00,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:00,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:00,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2061646100, now seen corresponding path program 1 times [2023-11-12 02:07:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355191446] [2023-11-12 02:07:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:07:00,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:07:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:07:01,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:07:01,005 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:07:01,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:07:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:07:01,015 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:01,020 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:07:01,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:07:01 BoogieIcfgContainer [2023-11-12 02:07:01,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:07:01,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:07:01,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:07:01,168 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:07:01,169 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:52" (3/4) ... [2023-11-12 02:07:01,171 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:07:01,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:07:01,173 INFO L158 Benchmark]: Toolchain (without parser) took 9694.85ms. Allocated memory was 123.7MB in the beginning and 232.8MB in the end (delta: 109.1MB). Free memory was 77.5MB in the beginning and 178.1MB in the end (delta: -100.6MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,173 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:07:01,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.04ms. Allocated memory is still 123.7MB. Free memory was 77.5MB in the beginning and 63.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.28ms. Allocated memory is still 123.7MB. Free memory was 63.6MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,174 INFO L158 Benchmark]: Boogie Preprocessor took 71.44ms. Allocated memory is still 123.7MB. Free memory was 60.8MB in the beginning and 59.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:07:01,175 INFO L158 Benchmark]: RCFGBuilder took 627.66ms. Allocated memory was 123.7MB in the beginning and 186.6MB in the end (delta: 62.9MB). Free memory was 59.1MB in the beginning and 146.0MB in the end (delta: -86.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,175 INFO L158 Benchmark]: TraceAbstraction took 8532.59ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 145.3MB in the beginning and 179.2MB in the end (delta: -33.9MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,175 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 232.8MB. Free memory was 179.2MB in the beginning and 178.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:07:01,178 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.34ms. Allocated memory is still 123.7MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.04ms. Allocated memory is still 123.7MB. Free memory was 77.5MB in the beginning and 63.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.28ms. Allocated memory is still 123.7MB. Free memory was 63.6MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.44ms. Allocated memory is still 123.7MB. Free memory was 60.8MB in the beginning and 59.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 627.66ms. Allocated memory was 123.7MB in the beginning and 186.6MB in the end (delta: 62.9MB). Free memory was 59.1MB in the beginning and 146.0MB in the end (delta: -86.9MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8532.59ms. Allocated memory was 186.6MB in the beginning and 232.8MB in the end (delta: 46.1MB). Free memory was 145.3MB in the beginning and 179.2MB in the end (delta: -33.9MB). Peak memory consumption was 127.8MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 232.8MB. Free memory was 179.2MB in the beginning and 178.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=16, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=128, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=-10, var_1_9=123] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=1, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, stepLocal_2=0, stepLocal_3=1, stepLocal_4=128, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=123, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=2147483652, var_1_19=128, var_1_1=254, var_1_21=0, var_1_22=2147483654, var_1_23=0, var_1_24=1, var_1_5=2147483653, var_1_7=254, var_1_8=0, var_1_9=123] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 1615 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 978 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 637 mSDtfsCounter, 652 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 872 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 266 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 3264 SizeOfPredicates, 8 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 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:07:01,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/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 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:07:04,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:07:04,152 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:07:04,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:07:04,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:07:04,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:07:04,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:07:04,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:07:04,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:07:04,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:07:04,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:07:04,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:07:04,214 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:07:04,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:07:04,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:07:04,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:07:04,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:07:04,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:07:04,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:07:04,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:07:04,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:07:04,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:07:04,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:07:04,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:07:04,226 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:07:04,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:07:04,227 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:07:04,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:07:04,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:07:04,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:07:04,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:07:04,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:07:04,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:07:04,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:07:04,231 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:07:04,232 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:07:04,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:07:04,232 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:07:04,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:07:04,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:07:04,234 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:07:04,234 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:07:04,235 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_74819889-df85-4bfa-9212-8026048d7628/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_74819889-df85-4bfa-9212-8026048d7628/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 -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2023-11-12 02:07:04,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:07:04,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:07:04,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:07:04,710 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:07:04,710 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:07:04,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:07:07,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:07:08,302 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:07:08,304 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:07:08,318 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/7941d2bbd/cba1105b37ed4ede95f35c5e6d93ee4d/FLAG05829f06e [2023-11-12 02:07:08,338 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/data/7941d2bbd/cba1105b37ed4ede95f35c5e6d93ee4d [2023-11-12 02:07:08,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:07:08,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:07:08,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:07:08,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:07:08,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:07:08,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75de7bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08, skipping insertion in model container [2023-11-12 02:07:08,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:07:08,625 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_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-12 02:07:08,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:07:08,750 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:07:08,769 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_74819889-df85-4bfa-9212-8026048d7628/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-51.i[913,926] [2023-11-12 02:07:08,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:07:08,855 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:07:08,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08 WrapperNode [2023-11-12 02:07:08,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:07:08,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:07:08,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:07:08,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:07:08,866 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:07:08" (1/1) ... [2023-11-12 02:07:08,892 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:07:08" (1/1) ... [2023-11-12 02:07:08,940 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-11-12 02:07:08,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:07:08,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:07:08,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:07:08,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:07:08,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:08,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:09,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:09,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:09,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:09,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:07:09,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:07:09,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:07:09,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:07:09,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (1/1) ... [2023-11-12 02:07:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:07:09,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:07:09,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:09,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:07:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:07:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:07:09,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:07:09,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:07:09,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:07:09,248 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:07:09,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:07:17,160 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:07:17,168 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:07:17,168 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:07:17,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:07:17 BoogieIcfgContainer [2023-11-12 02:07:17,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:07:17,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:07:17,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:07:17,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:07:17,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:07:08" (1/3) ... [2023-11-12 02:07:17,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4361e981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:07:17, skipping insertion in model container [2023-11-12 02:07:17,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:07:08" (2/3) ... [2023-11-12 02:07:17,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4361e981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:07:17, skipping insertion in model container [2023-11-12 02:07:17,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:07:17" (3/3) ... [2023-11-12 02:07:17,181 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-51.i [2023-11-12 02:07:17,201 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:07:17,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:07:17,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:07:17,261 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;@44d7599a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:07:17,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:07:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:07:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-12 02:07:17,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:17,284 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:17,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1740960990, now seen corresponding path program 1 times [2023-11-12 02:07:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:07:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128770551] [2023-11-12 02:07:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:17,307 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:07:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:07:17,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:17,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:07:18,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-12 02:07:18,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:07:18,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:07:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128770551] [2023-11-12 02:07:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128770551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:18,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:18,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:07:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259348444] [2023-11-12 02:07:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:18,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:07:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:07:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:07:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:07:18,740 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:07:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:18,800 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2023-11-12 02:07:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:07:18,802 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2023-11-12 02:07:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:18,820 INFO L225 Difference]: With dead ends: 127 [2023-11-12 02:07:18,820 INFO L226 Difference]: Without dead ends: 63 [2023-11-12 02:07:18,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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:07:18,826 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:07:18,827 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:07:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-12 02:07:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-12 02:07:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:07:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2023-11-12 02:07:18,882 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2023-11-12 02:07:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:18,883 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2023-11-12 02:07:18,883 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-12 02:07:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2023-11-12 02:07:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-12 02:07:18,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:18,897 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:19,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:19,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1440285028, now seen corresponding path program 1 times [2023-11-12 02:07:19,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:07:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941022275] [2023-11-12 02:07:19,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:19,128 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:07:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:07:19,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:19,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:20,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-12 02:07:20,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:07:21,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:07:21,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:07:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941022275] [2023-11-12 02:07:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941022275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:07:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344095134] [2023-11-12 02:07:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:07:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:07:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:07:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:07:21,866 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:07:24,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:28,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:30,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:33,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:36,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:38,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:38,466 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2023-11-12 02:07:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:07:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2023-11-12 02:07:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:38,693 INFO L225 Difference]: With dead ends: 184 [2023-11-12 02:07:38,693 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 02:07:38,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:07:38,696 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:38,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 16.5s Time] [2023-11-12 02:07:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 02:07:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2023-11-12 02:07:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:07:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2023-11-12 02:07:38,754 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2023-11-12 02:07:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:38,757 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2023-11-12 02:07:38,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:07:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2023-11-12 02:07:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-12 02:07:38,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:38,764 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:38,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:38,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:38,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash -810717471, now seen corresponding path program 1 times [2023-11-12 02:07:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:07:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828078875] [2023-11-12 02:07:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:38,992 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:07:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:07:38,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:38,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74819889-df85-4bfa-9212-8026048d7628/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:07:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:40,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:07:40,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-11-12 02:07:41,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:07:41,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:07:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828078875] [2023-11-12 02:07:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828078875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:07:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297864686] [2023-11-12 02:07:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:41,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:07:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:07:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:07:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:07:41,894 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-12 02:07:45,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:07:47,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []