./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu --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 bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:41:42,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:42,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:41:42,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:42,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:42,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:42,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:42,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:42,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:41:42,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:41:42,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:42,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:42,193 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:42,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:42,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:41:42,196 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:41:42,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:41:42,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:41:42,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:42,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:41:42,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:41:42,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:41:42,199 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:41:42,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:41:42,200 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:42,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:42,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:42,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:41:42,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:42,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:42,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:41:42,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:41:42,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:41:42,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:41:42,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:41:42,203 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:41:42,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:41:42,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:41:42,204 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:41:42,204 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_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu 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 -> bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e [2023-11-19 07:41:42,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:42,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:42,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:42,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:42,537 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:42,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:41:45,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:46,138 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:46,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:41:46,154 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/9203f5b23/2f0a145ca74341c3ae780d27965e4bf7/FLAGda2296a4e [2023-11-19 07:41:46,175 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/9203f5b23/2f0a145ca74341c3ae780d27965e4bf7 [2023-11-19 07:41:46,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:46,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:46,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:46,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:46,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:46,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ea6996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46, skipping insertion in model container [2023-11-19 07:41:46,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,251 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:46,446 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_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2023-11-19 07:41:46,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:46,570 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:46,582 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_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2023-11-19 07:41:46,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:46,629 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:46,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46 WrapperNode [2023-11-19 07:41:46,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:46,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:46,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:46,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:46,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,693 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2023-11-19 07:41:46,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:46,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:46,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:46,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:46,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:46,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:46,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:46,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:46,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (1/1) ... [2023-11-19 07:41:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:46,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:41:46,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:41:46,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:46,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:41:46,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:41:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:41:46,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:46,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:47,017 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:47,020 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:47,599 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:47,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:47,622 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:41:47,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:47 BoogieIcfgContainer [2023-11-19 07:41:47,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:47,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:41:47,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:41:47,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:41:47,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:46" (1/3) ... [2023-11-19 07:41:47,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa5fc1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:47, skipping insertion in model container [2023-11-19 07:41:47,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:46" (2/3) ... [2023-11-19 07:41:47,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa5fc1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:47, skipping insertion in model container [2023-11-19 07:41:47,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:47" (3/3) ... [2023-11-19 07:41:47,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:41:47,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:41:47,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:41:47,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:41:47,744 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;@5eb95ab1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:41:47,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:41:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:41:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-19 07:41:47,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:47,802 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:47,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:47,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1181104061, now seen corresponding path program 1 times [2023-11-19 07:41:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805621705] [2023-11-19 07:41:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805621705] [2023-11-19 07:41:48,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805621705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:48,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337824353] [2023-11-19 07:41:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:48,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:41:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:48,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:41:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:41:48,373 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:41:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:48,411 INFO L93 Difference]: Finished difference Result 149 states and 248 transitions. [2023-11-19 07:41:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:41:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2023-11-19 07:41:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:48,425 INFO L225 Difference]: With dead ends: 149 [2023-11-19 07:41:48,425 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 07:41:48,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:41:48,433 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:48,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 07:41:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-19 07:41:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:41:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2023-11-19 07:41:48,488 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 111 [2023-11-19 07:41:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:48,489 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2023-11-19 07:41:48,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:41:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2023-11-19 07:41:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-19 07:41:48,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:48,496 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:48,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:41:48,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:48,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1328366721, now seen corresponding path program 1 times [2023-11-19 07:41:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765991014] [2023-11-19 07:41:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:48,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765991014] [2023-11-19 07:41:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765991014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:48,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:41:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520328501] [2023-11-19 07:41:48,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:48,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:41:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:48,906 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:48,999 INFO L93 Difference]: Finished difference Result 205 states and 310 transitions. [2023-11-19 07:41:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:49,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-11-19 07:41:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:49,004 INFO L225 Difference]: With dead ends: 205 [2023-11-19 07:41:49,004 INFO L226 Difference]: Without dead ends: 134 [2023-11-19 07:41:49,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:49,007 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 97 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:49,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 263 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-19 07:41:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2023-11-19 07:41:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:41:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2023-11-19 07:41:49,029 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 111 [2023-11-19 07:41:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:49,031 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2023-11-19 07:41:49,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2023-11-19 07:41:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-19 07:41:49,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:49,038 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:49,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:41:49,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:49,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:49,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1686736897, now seen corresponding path program 1 times [2023-11-19 07:41:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560955566] [2023-11-19 07:41:49,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:49,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560955566] [2023-11-19 07:41:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560955566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:49,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:49,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504647988] [2023-11-19 07:41:49,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:49,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:49,613 INFO L87 Difference]: Start difference. First operand 94 states and 140 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:49,967 INFO L93 Difference]: Finished difference Result 305 states and 457 transitions. [2023-11-19 07:41:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:41:49,968 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2023-11-19 07:41:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:49,971 INFO L225 Difference]: With dead ends: 305 [2023-11-19 07:41:49,972 INFO L226 Difference]: Without dead ends: 214 [2023-11-19 07:41:49,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:49,974 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:49,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 352 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-19 07:41:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 179. [2023-11-19 07:41:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 144 states have (on average 1.4027777777777777) internal successors, (202), 144 states have internal predecessors, (202), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:41:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2023-11-19 07:41:50,020 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 111 [2023-11-19 07:41:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:50,021 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2023-11-19 07:41:50,021 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2023-11-19 07:41:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-19 07:41:50,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:50,032 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:50,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:41:50,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:50,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash -980945210, now seen corresponding path program 1 times [2023-11-19 07:41:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932027638] [2023-11-19 07:41:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932027638] [2023-11-19 07:41:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932027638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:53,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:41:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824708209] [2023-11-19 07:41:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:53,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:41:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:41:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:53,480 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:41:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:53,973 INFO L93 Difference]: Finished difference Result 473 states and 697 transitions. [2023-11-19 07:41:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:53,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2023-11-19 07:41:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:53,977 INFO L225 Difference]: With dead ends: 473 [2023-11-19 07:41:53,977 INFO L226 Difference]: Without dead ends: 297 [2023-11-19 07:41:53,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:41:53,981 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 226 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:53,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 383 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:41:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-19 07:41:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 274. [2023-11-19 07:41:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 222 states have (on average 1.3468468468468469) internal successors, (299), 222 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:41:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 395 transitions. [2023-11-19 07:41:54,016 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 395 transitions. Word has length 112 [2023-11-19 07:41:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:54,017 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 395 transitions. [2023-11-19 07:41:54,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:41:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 395 transitions. [2023-11-19 07:41:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:41:54,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:54,019 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:54,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:41:54,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:54,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1011780649, now seen corresponding path program 1 times [2023-11-19 07:41:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660564214] [2023-11-19 07:41:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:54,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660564214] [2023-11-19 07:41:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660564214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:54,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:54,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480534977] [2023-11-19 07:41:54,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:54,273 INFO L87 Difference]: Start difference. First operand 274 states and 395 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:54,639 INFO L93 Difference]: Finished difference Result 469 states and 684 transitions. [2023-11-19 07:41:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:54,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-19 07:41:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:54,644 INFO L225 Difference]: With dead ends: 469 [2023-11-19 07:41:54,644 INFO L226 Difference]: Without dead ends: 378 [2023-11-19 07:41:54,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:54,646 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 203 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:54,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 555 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-11-19 07:41:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 279. [2023-11-19 07:41:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 227 states have internal predecessors, (307), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:41:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 403 transitions. [2023-11-19 07:41:54,693 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 403 transitions. Word has length 113 [2023-11-19 07:41:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:54,694 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 403 transitions. [2023-11-19 07:41:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 403 transitions. [2023-11-19 07:41:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:41:54,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:54,696 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:54,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:41:54,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:54,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2074177717, now seen corresponding path program 1 times [2023-11-19 07:41:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646341342] [2023-11-19 07:41:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:55,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646341342] [2023-11-19 07:41:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646341342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331758043] [2023-11-19 07:41:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:55,123 INFO L87 Difference]: Start difference. First operand 279 states and 403 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:55,220 INFO L93 Difference]: Finished difference Result 588 states and 852 transitions. [2023-11-19 07:41:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-11-19 07:41:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:55,225 INFO L225 Difference]: With dead ends: 588 [2023-11-19 07:41:55,226 INFO L226 Difference]: Without dead ends: 312 [2023-11-19 07:41:55,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 07:41:55,229 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:55,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 364 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-19 07:41:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2023-11-19 07:41:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 227 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 07:41:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 395 transitions. [2023-11-19 07:41:55,293 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 395 transitions. Word has length 113 [2023-11-19 07:41:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:55,294 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 395 transitions. [2023-11-19 07:41:55,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 395 transitions. [2023-11-19 07:41:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:41:55,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:55,296 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:41:55,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:55,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1195732167, now seen corresponding path program 1 times [2023-11-19 07:41:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387600180] [2023-11-19 07:41:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:41:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:41:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:41:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:41:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:41:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:41:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:41:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:41:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:41:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:41:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387600180] [2023-11-19 07:41:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387600180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217957628] [2023-11-19 07:41:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:55,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:55,615 INFO L87 Difference]: Start difference. First operand 279 states and 395 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:56,238 INFO L93 Difference]: Finished difference Result 757 states and 1069 transitions. [2023-11-19 07:41:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-19 07:41:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:56,243 INFO L225 Difference]: With dead ends: 757 [2023-11-19 07:41:56,243 INFO L226 Difference]: Without dead ends: 661 [2023-11-19 07:41:56,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:56,245 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 248 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:56,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 464 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:41:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-19 07:41:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 476. [2023-11-19 07:41:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 390 states have (on average 1.317948717948718) internal successors, (514), 390 states have internal predecessors, (514), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-19 07:41:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 674 transitions. [2023-11-19 07:41:56,377 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 674 transitions. Word has length 117 [2023-11-19 07:41:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:56,378 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 674 transitions. [2023-11-19 07:41:56,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:41:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 674 transitions. [2023-11-19 07:41:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:41:56,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:56,381 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:56,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:41:56,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:56,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1914188702, now seen corresponding path program 1 times [2023-11-19 07:41:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782650361] [2023-11-19 07:41:56,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:42:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:42:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:42:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:42:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:42:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:42:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-19 07:42:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:42:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-19 07:42:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:42:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:42:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782650361] [2023-11-19 07:42:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782650361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:42:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025396594] [2023-11-19 07:42:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:42:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:42:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:42:09,930 INFO L87 Difference]: Start difference. First operand 476 states and 674 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:17,110 INFO L93 Difference]: Finished difference Result 1090 states and 1511 transitions. [2023-11-19 07:42:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:42:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-19 07:42:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:17,116 INFO L225 Difference]: With dead ends: 1090 [2023-11-19 07:42:17,117 INFO L226 Difference]: Without dead ends: 909 [2023-11-19 07:42:17,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:42:17,118 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 231 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:17,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 475 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-19 07:42:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-11-19 07:42:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 826. [2023-11-19 07:42:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 725 states have (on average 1.3255172413793104) internal successors, (961), 730 states have internal predecessors, (961), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-19 07:42:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1141 transitions. [2023-11-19 07:42:17,316 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1141 transitions. Word has length 117 [2023-11-19 07:42:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:17,318 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1141 transitions. [2023-11-19 07:42:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1141 transitions. [2023-11-19 07:42:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:42:17,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:17,321 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:17,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:42:17,321 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:17,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 575340260, now seen corresponding path program 1 times [2023-11-19 07:42:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428927224] [2023-11-19 07:42:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:42:17,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:42:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:42:17,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:42:17,503 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:42:17,504 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:42:17,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:42:17,510 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:17,514 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:42:17,618 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-19 07:42:17,620 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-19 07:42:17,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-19 07:42:17,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-19 07:42:17,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,621 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-19 07:42:17,622 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-19 07:42:17,622 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated [2023-11-19 07:42:17,622 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-19 07:42:17,623 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-19 07:42:17,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:42:17 BoogieIcfgContainer [2023-11-19 07:42:17,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:42:17,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:42:17,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:42:17,648 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:42:17,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:47" (3/4) ... [2023-11-19 07:42:17,651 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:42:17,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:42:17,652 INFO L158 Benchmark]: Toolchain (without parser) took 31467.57ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 107.9MB in the beginning and 169.2MB in the end (delta: -61.3MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,653 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 115.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:42:17,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.00ms. Allocated memory is still 138.4MB. Free memory was 107.5MB in the beginning and 93.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.92ms. Allocated memory is still 138.4MB. Free memory was 93.7MB in the beginning and 89.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,654 INFO L158 Benchmark]: Boogie Preprocessor took 47.91ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,654 INFO L158 Benchmark]: RCFGBuilder took 883.10ms. Allocated memory is still 138.4MB. Free memory was 87.8MB in the beginning and 64.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,655 INFO L158 Benchmark]: TraceAbstraction took 30018.63ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 63.2MB in the beginning and 170.2MB in the end (delta: -107.0MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2023-11-19 07:42:17,655 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 251.7MB. Free memory was 170.2MB in the beginning and 169.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:42:17,658 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 115.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.00ms. Allocated memory is still 138.4MB. Free memory was 107.5MB in the beginning and 93.7MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.92ms. Allocated memory is still 138.4MB. Free memory was 93.7MB in the beginning and 89.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.91ms. Allocated memory is still 138.4MB. Free memory was 89.8MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 883.10ms. Allocated memory is still 138.4MB. Free memory was 87.8MB in the beginning and 64.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 30018.63ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 63.2MB in the beginning and 170.2MB in the end (delta: -107.0MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 251.7MB. Free memory was 170.2MB in the beginning and 169.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0, var_1_9=643/5] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_10=580, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1235 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1235 mSDsluCounter, 2968 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1771 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1087 IncrementalHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 1197 mSDtfsCounter, 1087 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 498 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 897 ConstructedInterpolants, 0 QuantifiedInterpolants, 13972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3840/3840 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-19 07:42:17,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu --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 bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:20,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:20,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:42:20,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:20,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:20,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:20,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:20,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:20,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:20,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:20,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:20,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:20,482 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:20,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:20,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:42:20,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:20,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:20,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:20,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:42:20,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:20,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:42:20,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:42:20,492 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:42:20,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:42:20,492 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:20,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:42:20,493 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:20,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:20,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:20,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:20,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:20,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:20,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:20,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:42:20,496 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:42:20,496 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:42:20,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:20,497 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:42:20,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:20,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:20,497 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:42:20,499 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:20,500 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_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu 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 -> bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e [2023-11-19 07:42:20,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:20,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:20,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:20,956 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:20,956 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:20,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:42:24,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:42:24,544 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:42:24,546 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:42:24,562 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/42245f541/03489c3c80ff4c58a24a9c4b9098dfcd/FLAG848f8d2e7 [2023-11-19 07:42:24,578 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/data/42245f541/03489c3c80ff4c58a24a9c4b9098dfcd [2023-11-19 07:42:24,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:42:24,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:42:24,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:24,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:42:24,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:42:24,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:24,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488cfd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24, skipping insertion in model container [2023-11-19 07:42:24,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:24,638 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:42:24,786 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_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2023-11-19 07:42:24,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:24,872 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:42:24,897 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_219246e9-877f-4a8c-9213-325ca6cae7da/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2023-11-19 07:42:24,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:24,981 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:42:24,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24 WrapperNode [2023-11-19 07:42:24,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:24,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:24,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:42:24,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:42:25,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,076 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-11-19 07:42:25,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:25,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:42:25,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:42:25,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:42:25,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:42:25,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:42:25,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:42:25,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:42:25,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (1/1) ... [2023-11-19 07:42:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:25,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:42:25,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:42:25,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:42:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:42:25,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:42:25,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:42:25,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:42:25,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:42:25,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:42:25,383 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:42:25,385 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:42:25,827 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:42:25,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:42:25,837 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:42:25,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:25 BoogieIcfgContainer [2023-11-19 07:42:25,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:42:25,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:42:25,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:42:25,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:42:25,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:24" (1/3) ... [2023-11-19 07:42:25,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634ebd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:25, skipping insertion in model container [2023-11-19 07:42:25,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:24" (2/3) ... [2023-11-19 07:42:25,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634ebd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:25, skipping insertion in model container [2023-11-19 07:42:25,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:25" (3/3) ... [2023-11-19 07:42:25,852 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-97.i [2023-11-19 07:42:25,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:42:25,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:42:25,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:42:25,936 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;@4d8b200d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:42:25,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:42:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:42:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 07:42:25,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:25,957 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:25,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:25,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 634659171, now seen corresponding path program 1 times [2023-11-19 07:42:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:42:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026028180] [2023-11-19 07:42:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:25,980 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-19 07:42:25,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:42:26,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:26,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:26,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:42:26,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2023-11-19 07:42:26,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:42:26,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:42:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026028180] [2023-11-19 07:42:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026028180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:42:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689142172] [2023-11-19 07:42:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:26,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:42:26,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:42:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:42:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:42:26,597 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:42:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:26,646 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2023-11-19 07:42:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:42:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2023-11-19 07:42:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:26,660 INFO L225 Difference]: With dead ends: 109 [2023-11-19 07:42:26,660 INFO L226 Difference]: Without dead ends: 54 [2023-11-19 07:42:26,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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-19 07:42:26,670 INFO L413 NwaCegarLoop]: 79 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, 79 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-19 07:42:26,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:42:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-19 07:42:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-19 07:42:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:42:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2023-11-19 07:42:26,733 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 107 [2023-11-19 07:42:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:26,733 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2023-11-19 07:42:26,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:42:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2023-11-19 07:42:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 07:42:26,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:26,740 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:26,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:26,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:26,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:26,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1931481759, now seen corresponding path program 1 times [2023-11-19 07:42:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:42:26,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873132358] [2023-11-19 07:42:26,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:26,959 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-19 07:42:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:42:26,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:27,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:27,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:42:27,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-19 07:42:27,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:42:27,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:42:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873132358] [2023-11-19 07:42:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873132358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:27,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:27,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:42:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183611086] [2023-11-19 07:42:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:42:27,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:27,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:27,304 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:27,678 INFO L93 Difference]: Finished difference Result 111 states and 158 transitions. [2023-11-19 07:42:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:42:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-19 07:42:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:27,682 INFO L225 Difference]: With dead ends: 111 [2023-11-19 07:42:27,682 INFO L226 Difference]: Without dead ends: 60 [2023-11-19 07:42:27,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:42:27,685 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 88 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:27,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 106 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:42:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-19 07:42:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2023-11-19 07:42:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:42:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2023-11-19 07:42:27,700 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 107 [2023-11-19 07:42:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:27,701 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2023-11-19 07:42:27,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:27,702 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2023-11-19 07:42:27,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 07:42:27,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:27,704 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:27,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:27,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:27,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:27,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1662420959, now seen corresponding path program 1 times [2023-11-19 07:42:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:42:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269327054] [2023-11-19 07:42:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:27,915 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-19 07:42:27,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:42:27,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:27,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:28,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:42:28,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:42:28,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:42:28,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:42:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269327054] [2023-11-19 07:42:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269327054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:28,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:28,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:42:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133867588] [2023-11-19 07:42:28,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:28,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:42:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:28,480 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:28,721 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2023-11-19 07:42:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:42:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-19 07:42:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:28,724 INFO L225 Difference]: With dead ends: 146 [2023-11-19 07:42:28,724 INFO L226 Difference]: Without dead ends: 93 [2023-11-19 07:42:28,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:28,726 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:28,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:42:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-19 07:42:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2023-11-19 07:42:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:42:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2023-11-19 07:42:28,744 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 107 [2023-11-19 07:42:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:28,745 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2023-11-19 07:42:28,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2023-11-19 07:42:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:42:28,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:28,748 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:28,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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)] Forceful destruction successful, exit code 0 [2023-11-19 07:42:28,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:28,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:28,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1132663117, now seen corresponding path program 1 times [2023-11-19 07:42:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:42:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101177303] [2023-11-19 07:42:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:28,957 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-19 07:42:28,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:42:28,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:28,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 07:42:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:29,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:42:29,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:42:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:42:29,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:42:29,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:42:29,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101177303] [2023-11-19 07:42:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101177303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:42:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814778224] [2023-11-19 07:42:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:29,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:42:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:29,850 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:30,120 INFO L93 Difference]: Finished difference Result 169 states and 223 transitions. [2023-11-19 07:42:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:30,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-11-19 07:42:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:30,123 INFO L225 Difference]: With dead ends: 169 [2023-11-19 07:42:30,123 INFO L226 Difference]: Without dead ends: 116 [2023-11-19 07:42:30,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:30,125 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:30,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:42:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-19 07:42:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2023-11-19 07:42:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:42:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2023-11-19 07:42:30,160 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 108 [2023-11-19 07:42:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:30,161 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2023-11-19 07:42:30,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:42:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2023-11-19 07:42:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-19 07:42:30,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:30,168 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:30,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-19 07:42:30,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:30,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:30,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 808167104, now seen corresponding path program 1 times [2023-11-19 07:42:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:42:30,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966042232] [2023-11-19 07:42:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:30,374 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-19 07:42:30,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:42:30,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/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-19 07:42:30,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_219246e9-877f-4a8c-9213-325ca6cae7da/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-19 07:42:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:30,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 07:42:30,554 INFO L285 TraceCheckSpWp]: Computing forward predicates...