./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-007.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:50,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:50,893 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:35:50,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:50,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:50,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:50,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:50,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:50,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:50,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:50,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:50,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:50,960 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:50,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:50,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:50,963 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:50,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:35:50,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:50,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:50,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:50,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:50,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:50,966 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:50,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:50,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:50,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:50,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:50,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:50,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:50,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:50,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:50,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:50,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:35:50,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:35:50,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:50,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:50,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:50,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:50,974 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:50,975 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_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/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_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2023-11-06 22:35:51,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:51,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:51,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:51,331 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:51,332 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:51,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/xcsp/AllInterval-007.c [2023-11-06 22:35:54,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:54,666 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:54,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/sv-benchmarks/c/xcsp/AllInterval-007.c [2023-11-06 22:35:54,675 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/data/55e8ef131/ad4a297922a14be0b5b11940062941b3/FLAG580018123 [2023-11-06 22:35:54,689 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/data/55e8ef131/ad4a297922a14be0b5b11940062941b3 [2023-11-06 22:35:54,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:54,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:54,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:54,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:54,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:54,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:54" (1/1) ... [2023-11-06 22:35:54,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4bd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:54, skipping insertion in model container [2023-11-06 22:35:54,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:54" (1/1) ... [2023-11-06 22:35:54,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:54,942 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_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2023-11-06 22:35:54,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:54,962 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:55,029 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_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/sv-benchmarks/c/xcsp/AllInterval-007.c[3690,3703] [2023-11-06 22:35:55,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:55,044 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:55,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55 WrapperNode [2023-11-06 22:35:55,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:55,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:55,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:55,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:55,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,094 INFO L138 Inliner]: procedures = 13, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2023-11-06 22:35:55,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:55,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:55,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:55,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:55,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:55,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:55,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:55,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:55,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (1/1) ... [2023-11-06 22:35:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:55,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:55,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:55,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2023-11-06 22:35:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2023-11-06 22:35:55,298 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:55,300 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:55,588 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:55,596 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:55,596 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:35:55,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:55 BoogieIcfgContainer [2023-11-06 22:35:55,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:55,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:55,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:55,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:55,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:54" (1/3) ... [2023-11-06 22:35:55,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de7338a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:55, skipping insertion in model container [2023-11-06 22:35:55,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:55" (2/3) ... [2023-11-06 22:35:55,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de7338a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:55, skipping insertion in model container [2023-11-06 22:35:55,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:55" (3/3) ... [2023-11-06 22:35:55,609 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2023-11-06 22:35:55,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:55,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:55,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:55,698 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=LoopsAndPotentialCycles, 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;@3e78e192, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:55,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 22:35:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2023-11-06 22:35:55,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:55,731 INFO L195 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:35:55,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:55,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 925921856, now seen corresponding path program 1 times [2023-11-06 22:35:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591276971] [2023-11-06 22:35:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:35:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:35:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:35:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 22:35:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:35:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:35:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:35:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:35:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:35:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:35:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 22:35:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 22:35:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:35:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:35:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:35:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:35:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 22:35:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:35:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:35:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:35:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 22:35:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-06 22:35:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-06 22:35:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-06 22:35:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:35:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-06 22:35:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-06 22:35:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-06 22:35:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-06 22:35:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 22:35:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-06 22:35:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 22:35:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-06 22:35:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-06 22:35:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-06 22:35:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-06 22:35:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2023-11-06 22:35:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-06 22:35:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-06 22:35:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-06 22:35:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-06 22:35:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-06 22:35:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-06 22:35:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-06 22:35:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-06 22:35:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-06 22:35:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-11-06 22:35:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-06 22:35:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-11-06 22:35:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2023-11-06 22:35:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-11-06 22:35:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2023-11-06 22:35:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2023-11-06 22:35:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-11-06 22:35:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2023-11-06 22:35:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2023-11-06 22:35:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-11-06 22:35:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-06 22:35:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-11-06 22:35:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-11-06 22:35:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-06 22:35:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-11-06 22:35:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-11-06 22:35:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2023-11-06 22:35:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:56,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591276971] [2023-11-06 22:35:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591276971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601905902] [2023-11-06 22:35:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:56,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:35:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:35:56,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:56,807 INFO L87 Difference]: Start difference. First operand has 98 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2023-11-06 22:35:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:56,858 INFO L93 Difference]: Finished difference Result 190 states and 392 transitions. [2023-11-06 22:35:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:35:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 362 [2023-11-06 22:35:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:56,870 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:35:56,870 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:35:56,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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-06 22:35:56,880 INFO L413 NwaCegarLoop]: 161 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, 161 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-06 22:35:56,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:35:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-06 22:35:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 22:35:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 161 transitions. [2023-11-06 22:35:56,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 161 transitions. Word has length 362 [2023-11-06 22:35:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:56,947 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 161 transitions. [2023-11-06 22:35:56,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2023-11-06 22:35:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 161 transitions. [2023-11-06 22:35:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2023-11-06 22:35:56,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:56,959 INFO L195 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:35:56,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:56,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:56,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1542672372, now seen corresponding path program 1 times [2023-11-06 22:35:56,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909384916] [2023-11-06 22:35:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:57,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:35:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:58,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:35:58,064 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:35:58,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:58,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-06 22:35:58,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:58,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:58 BoogieIcfgContainer [2023-11-06 22:35:58,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:58,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:58,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:58,231 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:58,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:55" (3/4) ... [2023-11-06 22:35:58,232 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:35:58,382 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:35:58,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:58,383 INFO L158 Benchmark]: Toolchain (without parser) took 3689.47ms. Allocated memory is still 172.0MB. Free memory was 126.7MB in the beginning and 69.1MB in the end (delta: 57.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,383 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:58,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.43ms. Allocated memory is still 172.0MB. Free memory was 126.1MB in the beginning and 114.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.69ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,385 INFO L158 Benchmark]: Boogie Preprocessor took 25.91ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:58,386 INFO L158 Benchmark]: RCFGBuilder took 477.05ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 93.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,386 INFO L158 Benchmark]: TraceAbstraction took 2627.96ms. Allocated memory is still 172.0MB. Free memory was 92.6MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,386 INFO L158 Benchmark]: Witness Printer took 152.27ms. Allocated memory is still 172.0MB. Free memory was 78.5MB in the beginning and 69.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:35:58,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.43ms. Allocated memory is still 172.0MB. Free memory was 126.1MB in the beginning and 114.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.69ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.91ms. Allocated memory is still 172.0MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 477.05ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 93.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2627.96ms. Allocated memory is still 172.0MB. Free memory was 92.6MB in the beginning and 78.5MB in the end (delta: 14.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Witness Printer took 152.27ms. Allocated memory is still 172.0MB. Free memory was 78.5MB in the beginning and 69.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 135]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=4] [L30] CALL assume(var0 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 6) VAL [dummy=0, var0=4] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=4, var1=0] [L34] CALL assume(var1 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 6) VAL [dummy=0, var0=4, var1=0] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6] [L38] CALL assume(var2 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1] [L42] CALL assume(var3 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2] [L46] CALL assume(var4 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5] [L50] CALL assume(var5 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 0) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3] [L54] CALL assume(var6 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4] [L58] CALL assume(var7 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6] [L62] CALL assume(var8 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6] [L63] int var9; [L64] var9 = __VERIFIER_nondet_int() [L65] CALL assume(var9 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var9 >= 1) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L66] CALL assume(var9 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var9 <= 6) VAL [dummy=0, var0=4, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L67] int var10; [L68] var10 = __VERIFIER_nondet_int() [L69] CALL assume(var10 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var10 >= 1) VAL [dummy=0, var0=4, var10=1, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L70] CALL assume(var10 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var10 <= 6) VAL [dummy=0, var0=4, var10=1, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L71] int var11; [L72] var11 = __VERIFIER_nondet_int() [L73] CALL assume(var11 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var11 >= 1) VAL [dummy=0, var0=4, var10=1, var11=3, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L74] CALL assume(var11 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var11 <= 6) VAL [dummy=0, var0=4, var10=1, var11=3, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L75] int var12; [L76] var12 = __VERIFIER_nondet_int() [L77] CALL assume(var12 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var12 >= 1) VAL [dummy=0, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L78] CALL assume(var12 <= 6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var12 <= 6) VAL [dummy=0, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L79] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L80] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L81] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L81] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L82] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L83] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L84] CALL assume(var0 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var0 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L85] CALL assume(var0 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L85] RET assume(var0 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L86] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L87] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L88] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L89] CALL assume(var1 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var1 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L90] CALL assume(var1 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume(var1 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L91] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L92] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L93] CALL assume(var2 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L93] RET assume(var2 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L94] CALL assume(var2 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L94] RET assume(var2 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L95] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L96] CALL assume(var3 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var3 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L97] CALL assume(var3 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L97] RET assume(var3 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L98] CALL assume(var4 != var5) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume(var4 != var5) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L99] CALL assume(var4 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var4 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L100] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L101] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L101] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L102] CALL assume(var7 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L102] RET assume(var7 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L103] CALL assume(var7 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var7 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L104] CALL assume(var7 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var7 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L105] CALL assume(var7 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L105] RET assume(var7 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L106] CALL assume(var8 != var9) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L106] RET assume(var8 != var9) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L107] CALL assume(var8 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var8 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L108] CALL assume(var8 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var8 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L109] CALL assume(var8 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L109] RET assume(var8 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L110] CALL assume(var9 != var10) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L110] RET assume(var9 != var10) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L111] CALL assume(var9 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var9 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L112] CALL assume(var9 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var9 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L113] CALL assume(var10 != var11) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L113] RET assume(var10 != var11) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L114] CALL assume(var10 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L114] RET assume(var10 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L115] CALL assume(var11 != var12) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var11 != var12) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5] [L116] int var_for_abs; [L117] var_for_abs = var0 - var1 [L118] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=4] [L119] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=4] [L120] var_for_abs = var1 - var2 [L121] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=6] [L122] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L122] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=6] [L123] var_for_abs = var2 - var3 [L124] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=5] [L125] CALL assume(var9 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L125] RET assume(var9 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=5] [L126] var_for_abs = var3 - var4 [L127] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=1] [L128] CALL assume(var10 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var10 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=1] [L129] var_for_abs = var4 - var5 [L130] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=3] [L131] CALL assume(var11 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var11 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=3] [L132] var_for_abs = var5 - var6 [L133] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=2] [L134] CALL assume(var12 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L134] RET assume(var12 == var_for_abs) VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=2] [L135] reach_error() VAL [dummy=0, myvar0=1, var0=4, var10=1, var11=3, var12=2, var1=0, var2=6, var3=1, var4=2, var5=5, var6=3, var7=4, var8=6, var9=5, var_for_abs=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 68, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 161 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 9112/9112 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 proved your program to be incorrect! [2023-11-06 22:35:58,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6bfb5709-1fa1-48a2-a7de-4d50951c99bc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE